#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long long n,cnt,f[10];
int main()
{
    n = 999999999999999956LL;
    for (int i = 0; i < 10; ++i) {
        (long long)(upper_bound(f+1,f+cnt+1,n)-f-1);
        cout << (long long)sqrt(n) << endl;
        cout << (long long)sqrt(n) << endl;
    }
}