Mod 7 in Manufactoria A simple Manufactoria challenge.  Compute the input modulo 7.  The input will be in big-endian binary (blue=1, red=0).  The output should be in the same format.

Test cases provided.  The smallest part count wins.

http://pleasingfungus.com/Manufactoria/?ctm=Mod7;Input:_binary_number_big_endian._Output:_that_binary_number_mod_7;bbb:|brrr:b|brrrr:br|bb:bb|bbrrb:brr|brrrrb:brb|bbrb:bbr;13;3;1;

(if the input mod 7 is 0, output nothing.)
The algorithm is quite straightforward: Compute the modulus using a state machine (the largest part with eight branches - one of the states is duplicated for logistical purposes), then encode and collect the results. Since almost every result contains a one digit, an extra compression step is employed to reduce the amount of parts.

Designed in yEd, then transcribed to Manufactoria. 

Uses way too many conveyer belts, in my opinion.