# Reverse Balls

**Computer Science**Level pending

Consider the binary tree below:

It has a height of 2 and has 4 leaves. You are going to pass down a ball from the root (the topmost node). Every node other than the leaves has a switch. If a node is *switched off*, the ball will pass to its left child; if a node is *switched on*, the ball will pass to its right child. After passing the ball, the switch will toggle (if it's *on* it becomes *off* and vice versa). Initially, every node is switched off.

Chris built a similar tree of infinite height and he wants a ball to pass through the \(12345678^\text{th}\) node. What is the minimum number of balls he must throw such that he can achieve his goal?

Output your answer modulo 1000.

You are advised to solve the Original version of this problem first.