#include <bits/stdc++.h>
using namespace std;
int N;
int INF = 1e9;
int x[] = {0, 0, INF, INF}, y[] = {0, INF, 0, INF};
int query(int x, int y) {
  printf("%d %d\n", x, y);
  fflush(stdout);
  char tmp[10];
  scanf("%s", tmp);
  return tmp[0] == 'w';
}
int answer(int sx, int sy, int ex, int ey) {
  printf("%d %d %d %d\n", sx, sy, ex, ey);
  fflush(stdout);
  return 0;
}
int cnt[2];
int ans[4];
int main() {
  scanf("%d", &N);
  int state = query(0, 0);
  int l = 0, r = INF;
  for (int i = 1; i <= N / 2; i++) {
    int mid = l + r >> 1;
    int q = query(mid, 0);
    if (state == q)
      l = mid;
    else
      r = mid;
  }
  int ax = l + r >> 1;
  l = 0, r = INF;
  for (int i = N / 2 + 1; i < N; i++) {
    int mid = l + r >> 1;
    int q = query(ax, mid);
    if (state == q)
      l = mid;
    else
      r = mid;
  }
  return answer(ax, l + r >> 1, ax + 1, 0);
}
