#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


void solve(){
    int n; cin >> n;

    ll MAX = 1e8;

    ll x = 0, y = 0;
    ll xlo = -MAX, xhi = MAX;
    ll ylo = -MAX, yhi = MAX;
    while(xhi - xlo > 2LL){
        ll mid1 = (xlo*2LL + xhi)/3LL;
        ll mid2 = (xlo + 2LL*xhi)/3LL;

        ll sum1 = 0, sum2 = 0;
        cout << 1 << ' ' << mid1 << ' ' << y << endl;
        cin >> sum1;
        cout << 1 << ' ' << mid2 << ' ' << y << endl;
        cin >> sum2;
        
        if(sum1 > sum2) xlo = mid1;
        else xhi = mid2;
    }

    while(yhi - ylo > 2LL){
        ll mid1 = (ylo*2LL + yhi)/3LL;
        ll mid2 = (ylo + 2LL*yhi)/3LL;

        ll sum1 = 0, sum2 = 0;
        cout << 1 << ' ' << x << ' ' << mid1 << endl;
        cin >> sum1;
        cout << 1 << ' ' << x << ' ' << mid2 << endl;
        cin >> sum2;
        
        if(sum1 > sum2) ylo = mid1;
        else yhi = mid2;
    }

    ll ans = LINF;
    ll ret = 0;
    for(ll i=xlo-2; i<=xhi+2; i++)for(ll j=ylo-2; j<=yhi+2; j++){
        cout << 1 << ' ' << i << ' ' << j << endl;
        cin >> ret;
        if(ret < ans){
            x = i;
            y = j;
            ans = ret;
        }
    }

    cout << 2 << ' ' << x << ' ' << y << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}