#pragma GCC optimize(2)
#pragma optimize(3, on)
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

using namespace std;

#define all(c) (c).begin(), (c).end()
#define rall(x) (x).rbegin(), (x).rend()
#define Sum(a) accumulate((a).begin(), (a).end() , 0ll)
#define Min(a) *std::min_element((a).begin(), (a).end())
#define Max(a) *std::max_element((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
#define each(x, a) for(auto& x : a)
#define mst(a, x) memset(a, x, sizeof(a))
#define LL long long
#define rep(i, from, to) for(ll i = from;i<to;i++)
#define rrep(i, from, to) for(ll i = from;i>to;i--)
#define to_uni(a) a.erase(unique(begin(a), end(a)), end(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pp pop_back
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int mod = 1e9 + 7;
const int P = 998244353;
const int INF = 0x3f3f3f3f;
const int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
const int fx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, fy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define int long long
const int inf = 1e18;

void solve()
{
    int n;
    cin >> n;
    auto ask = [&](int x , int y) {
        cout << x << " " << y << endl;
        int ans;
        cin >> ans;
        return ans;
    };  
    while(n > 0)
    {
        int d = ask(0,0);
        if(d == 0){
            n --;
            continue;
        }
        for(int x = 0 ;x <= 1000000 ; x ++)
        {
            int yy = d - x*x;
            int ys = sqrt(yy);

            if(0 <= ys && ys <= 1000000 && x*x+ys*ys == d) {
                int b = ask(x,ys);
                if(b == 0) {
                    n--;
                    break;
                }
            }
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout.precision(10); cout.setf(ios::fixed);
    int t = 1;
    // cin >> t;
    while(t--)
    solve();    

    return 0;
}