#include <bits/stdc++.h>

//#include <atcoder/all>
using namespace std;

#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x)                                                                \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y)                                                             \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z)                                                          \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
         << TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z)                                                       \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z        \
         << endl;
#define LOG5(w, x, y, z, a)                                                    \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b)                                                 \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b        \
         << endl;

#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...)                                                               \
  overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

mt19937 engine;
std::chrono::system_clock::time_point start, endTime;

#define DEBUG 0

lli query(lli x, lli y) {
  cout << "1 " << x << " " << y << endl;
  lli ans;
  cin >> ans;
  return ans;
}

void solve() {
  //  write your code here

  lli N;
  cin >> N;

  const int BIG = 1e9;

  // x方向に対して3分探索する
  lli smallX = -1e9;
  lli largeX = 1e9;
  lli cnt = 0;
  while (smallX + 1 < largeX) {
    cnt++;
    if (cnt >= 75) {
      break;
    }
    lli smallMid = (smallX * 2 + largeX) / 3;
    lli largeMid = (smallX + largeX * 2) / 3;
    lli smallMidQuery = query(smallMid, BIG);
    lli largeMidQuery = query(largeMid, BIG);

    if (smallMidQuery < largeMidQuery) {
      largeX = largeMid;
    } else {
      smallX = smallMid;
    }
  }

  lli x = (smallX + largeX) / 2;

  cnt = 0;

  // y方向に対して3分探索する
  lli smallY = -1e9;
  lli largeY = 1e9;
  while (smallY + 1 < largeY) {
    cnt++;
    if (cnt >= 75) {
      break;
    }
    lli smallMid = (smallY * 2 + largeY) / 3;
    lli largeMid = (smallY + largeY * 2) / 3;
    lli smallMidQuery = query(BIG, smallMid);
    lli largeMidQuery = query(BIG, largeMid);

    if (smallMidQuery < largeMidQuery) {
      largeY = largeMid;
    } else {
      smallY = smallMid;
    }
  }

  lli y = (smallY + largeY) / 2;
  cout << "2 " << x << " " << y << endl;
}

// Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools  (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
  // Failed to predict input format

  lli N = 1;
  // cin >> N;
  while (N--)
    solve();

  return 0;
}