A corrupt country receives some educational grant from the UNESCO is the form of digital notebooks. The total number of notebooks that this country receives is N=(P!)/(Q!), where 0lePle99 and 0leQle99 such that P-Q=10. The country is diveided into varios levels L_1,L_2,L_3,... etc for adiministrative conveniences. Intitially, all the notebooks are with the head of L_1, who keeps half of the notebooks with himself and rest half of the nootbooks he doles out equally to the each head of L_2. Similarly, each head of L_2 keeps half of the notebooks with oneself and rest half of the notebooks he doles out to the each head of L_3 this pattern occurs till the level L_x to divide the number of notebooks to any of the heads of L_(x+1) and thus to the expected beneficiary. That is, the general public, which is supposed to receive the notebooks directly from L_(x+1) never receives any notebook. Also at any level the number of heads is never equal to 2. What's the maximum possible value of x?