func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long mod = 1000000007;   long long powmod(long long a, long long b) {     long long res = 1;     a %= mod;     assert(b >= 0);     for (; b; b >>= 1) {       if (b & 1) res = res * a % mod;       a = a * a % mod;     }     return res;   }   long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }   const int M = 1000000000;   char s[30];   bool answer(int x, int y) {     printf( %d %d n , x, y);     fflush(stdout);     scanf( %s , s);     return s[0] ==  b ;   }   int n;   int main() {     scanf( %d , &n);     bool ty = answer(0, M / 2);     int vl = 0, vr = M;     int l = 1, r = M;     for (int i = 1; i < n; i++) {       int mid = (l + r) >> 1;       bool ty2 = answer(mid, M / 2);       if (ty2 == ty) {         vl = max(vl, mid);         l = mid + 1;       } else {         vr = min(vr, mid);         r = mid - 1;       }     }     printf( %d %d %d %d n , vl, 0, vr, M);   }   