Consider Tower of Hanoi problem with poles, Counting binary digits

Consider a Tower of Hanoi problem with 3 poles A, B and C. Counting binary digits is analogous to the Tower of Hanoi problem. Let a variable x store the binary digits corresponding to each state after every movement of discs among the poles. For example, consider 3 discs a, b and c on pole A, where c is the largest and a is the smallest. This initial state means x = 000. When disc a is transferred from pole A to pole B, x becomes 001. When disc b is transferred from pole A to pole C, x becomes 010, and so on. If x = 00000 is considered state 1 of the Tower of Hanoi problem, then what is the value of x at state 4?