#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    /*
       凹関数なので三分探索
    */

    ll N, ansx;
    cin >> N;

    map<pair<ll, ll>, ll> mp;
    auto f=[&](ll x, ll y){
        ll res;
        if (mp.count({x, y})) return mp[{x, y}];
        cout << 1 << " " << x << " " << y << endl;
        cin >> res;
        return mp[{x, y}] = res;
    };

    //X方向
    ll l=-1e8, r=1e8+1, cl, cr;
    while(r-l>1){
        cl = (l*2+r)/3; cr = (l+r*2)/3;
        if (f(cl, 0) > f(cr, 0)) l = cl;
        else r = cr;
    }
    ansx = l;
    //Y方向
    l=-1e8; r=1e8+1;
    while(r-l>1){
        cl = (l*2+r)/3; cr = (l+r*2)/3;
        if (f(0, cl) > f(0, cr)) l = cl;
        else r = cr;
    }
    cout << 2 << " " << ansx << " " << l << endl;

    return 0;
}