Create a logic circuit machine that reads an integer and determines if it is divisible by

$3.$ For example, the machine would read integer $123$ as $1,2,3.$ If $123$ is divisible

by $3,$ it will output $1.$ Otherwise, the machine will output $0.$

You are given a black box function that calculates mod $3$ for integers $0-9.$

Hint: for any integer divisible by $3,$ the sum of all digits of this integer is divisible by $3.$