#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n;
char ch[10];
int main() {
  while (~scanf("%d", &n)) {
    if (n == 1) {
      cout << "0 0" << endl;
      scanf("%s", ch);
      cout << "1 0 0 1" << endl;
      continue;
    }
    int Right = 0, Up = 0;
    int nowx = 0, nowy = 0;
    int c = n / 2;
    int l = 0, r = 1e9;
    cout << "0 0" << endl;
    scanf("%s", ch);
    int x = (ch[0] == 'b' ? 1 : 0);
    for (int i = 1; i <= c; i++) {
      int mid = (l + r) >> 1;
      cout << nowx << " " << mid << endl;
      scanf("%s", ch);
      int temp = (ch[0] == 'b' ? 1 : 0);
      if (temp == x) {
        l = mid + 1;
        Up = max(Up, mid);
      } else
        r = mid - 1;
    }
    l = 0, r = 1e9;
    for (int i = 1; i <= n - c - 1; i++) {
      int mid = (l + r) >> 1;
      cout << mid << " " << nowy << endl;
      scanf("%s", ch);
      int temp = (ch[0] == 'b' ? 1 : 0);
      if (temp == x) {
        l = mid + 1;
        Right = max(Right, mid);
      } else
        r = mid - 1;
    }
    cout << "0 " << Up + 1 << " " << Right + 1 << " 0" << endl;
  }
  return 0;
}
