#include <bits/stdc++.h>
using namespace std;
int i, j, k, z, q, timer, x, y, n, m, cnt, even, flag, dlfjl, dskgj, dkfj,
    dskfj, boom;
int a[500500], b[500500], fac[500500], invfac[500500];
int query(int x, int y) {
  cout << x << " " << y << endl;
  fflush(stdout);
  string ans;
  cin >> ans;
  if (ans == "black") return 1;
  return 0;
}
int main() {
  cin >> n;
  int l = 1, r = 1e+9;
  int bit;
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      bit = query(1, 0);
      continue;
    }
    int mid = (l + r) / 2;
    int ans = (bit ^ query(mid, 0));
    if (ans == 0) {
      l = mid;
    } else {
      r = mid;
    }
  }
  cout << l - 1 << " " << 100 << " " << l << " " << 1 << endl;
  return 0;
}
