#include <bits/stdc++.h>
namespace io {
int F() {
  int F = 1, n = 0;
  char ch;
  while ((ch = getchar()) != '-' && (ch < '0' || ch > '9'))
    ;
  ch == '-' ? F = 0 : n = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9') n = n * 10 + ch - '0';
  return F ? n : -n;
}
long long G() {
  long long F = 1, n = 0;
  char ch;
  while ((ch = getchar()) != '-' && (ch < '0' || ch > '9'))
    ;
  ch == '-' ? F = 0 : n = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9') n = n * 10 + ch - '0';
  return F ? n : -n;
}
}  // namespace io
int R(int l, int r) { return (rand() << 15 | rand()) % (r - l + 1) + l; }
char s[11111];
bool qu(int x, int y) {
  printf("%d %d\n", x, y);
  fflush(stdout);
  scanf("%s", s);
  if (s[0] == 'b') return 0;
  return 1;
}
int main() {
  int n = io::F();
  if (n == 1) {
    qu(0, 0);
    printf("0 100000 100000 0\n");
    return 0;
  }
  int l = -999999998, r = 999999999, c = qu(1, 1000000000);
  for (register int i = 2; i <= n; ++i) {
    int mid = l + r >> 1;
    int d = mid <= 0 ? qu(1, 1 - mid) : qu(mid + 1, 1);
    if (d == c)
      l = mid + 1;
    else
      r = mid - 1;
  }
  if (l >= 0)
    printf("%d %d %d %d\n", l + 1, 0, l + 2, 2);
  else
    printf("%d %d %d %d\n", 0, 1 - l, 2, 2 - l);
  return 0;
}
