#include <bits/stdc++.h>
using namespace std;
using namespace std;
inline long long gcd(long long a, long long b) {
  return b ? gcd(b, a % b) : a;
};
const long long mod = 998244353;
long long QPow(long long a, long long b) {
  long long as = 1;
  if (b < 0) return 0;
  while (b) {
    if (b & 1) as = as * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return as;
}
const long long maxn = 3e5 + 100;
inline long long rd() {
  long long ans = 0;
  char last = ' ', ch = getchar();
  while (!(ch >= '0' && ch <= '9')) last = ch, ch = getchar();
  while (ch >= '0' && ch <= '9') ans = ans * 10 + ch - '0', ch = getchar();
  return ans;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t, n, m, k, u, v, a, b, k1, k2, L, R, D;
  cin >> n;
  string str;
  long long cur = 1 << 29;
  long long p2 = 1 << 29;
  for (long long i = 1; i <= n; i++) {
    cout << cur / 2 << " " << (cur + 1) / 2 << endl;
    cout.flush();
    cin >> str;
    if (str == "black")
      cur = cur + (p2 >>= 1);
    else
      cur -= (p2 >>= 1);
  }
  if (n == 30) {
    if (str == "black") {
      cout << cur / 2 << " " << cur / 2 + 2 << " " << cur / 2 + 1 << " "
           << cur / 2;
      cout << endl;
      cout.flush();
    } else {
      if (cur > 1)
        cout << cur / 2 - 1 << " " << cur / 2 + 1 << " " << cur / 2 + 1 << " "
             << cur / 2;
      else
        cout << "0 0 1 0\n";
      cout << endl;
      cout.flush();
    }
  } else {
    cout << cur / 2 << " " << (cur + 1) / 2 << " " << cur / 2 + 1 << " "
         << (cur + 1) / 2 - 1;
    cout << endl, cout.flush();
  }
  return 0;
}
