Number of odd paths in a binary tree

Can someone tell me the number of subtrees/path in a binary tree where each each ode in the path is a odd number. The tree has the following pattern
There is a edge between a vertex x and vertex x/2(rounded off)

This is a problem (June Circuits) of the ongoing contest. Have some shame. You won’t achieve anything by doing things like this.