Input

There are no more than 50 test cases.

Each case only contains a positivse integer n in a line.

1≤n≤10^18

Output

For each test case, output an integer indicates the number of positive integers k satisfy k^k≤n in a line. 

Sample Input

Sample Output

#include <iostream>

using namespace std;

typedef long long ll;

//a ^ a

__int64 POW(ll a)

{

    __int64 result = ;

    ll base = a;

    ll tmp = a;

    while(tmp > )

    {

        if((tmp & ) == )

            result = result * base;

        base = base * base;

        tmp >>= ;

    }

    return result;

}

//int main()

//{

//    ll a;

//    cin >> a;

//    cout << POW(a) << endl;

//

//    return 0;

//}

int main()

{

    ios::sync_with_stdio(false);

    __int64 n;

    while(cin >> n)

    {

        for(int i =  ; i >=  ; i--)

        {

            if(POW(i) <= n)

            {

                cout << i << endl;

                break;

            }

        }

    }

    return ;

}