Sissa Ben, a minister in ancient India, invented the game of chess. The king intended to reward him because of it. The minister said, “I want nothing but some wheat. Please put a grain of wheat on the first square of the chessboard, two on the second, four on the third, eight on the fourth, ..., and so on, doubling the number for each following square, and give me enough grains to cover the 64 squares of the chessboard.” The king ordered a bag of wheat brought to the palace. But when the counting began with one gain for the first square, two for the second, four for the third, and so on, the bag was emptied before the 20th square. More bags were brought but the number of grain needed for the following squares increased so rapidly that the king soon realized that he was not able to keep his promise even with all the crops in the whole India!
        Suppose the king had n wheat, which square should the last one cover?

 void cal_excel()

 {

     A[] = ;

     for(int i = ; i <= ; ++ i)

     {

         A[i] = A[i-] + pow(, i-);

     }

     return ;

 }

 #include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <cmath>

 #include <stack>

 #include <map>

 #include <queue>

 using namespace std;

 long long A[];

 void cal_excel()

 {

     A[] = ;

     for(int i = ; i <= ; ++ i)

         A[i] = A[i-] + pow(, i-);

 }

 int main()

 {

     cal_excel();

     long long n;

     while(~scanf("%lld", &n), n)

     {

         for(int i = ; i <= ; ++ i)

         {

             if(A[i] >= n)

             {

                 printf("%d\n", i);

                 break;

             }

         }

     }

     return ;

 }