topic : Finite State Machines

Consider the following Finite State Machine that computes whether a binary number, V$,$ is divisible by $4$ with a remainder of $0,$ when the number, V$,$ is entered least significant bit first. It is implemented using the following logic $(picture).$ What is the binary encoding used for $3/5$ the Y state?