#include <bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin>>N;
  string temp;
  string A[N];
  
  cout<<0<<endl;
  cin>>temp;
  if(temp=="Vacant"){
    cout<<0<<endl;
    return 0;
  }
  if(temp=="Male"){
    A[0]="Male";
  }
  if(temp=="Female"){
    A[0]="Female";
  }
  
  cout<<N-1<<endl;
  cin>>temp;
  if(temp=="Vacant"){
    cout<<N-1<<endl;
    return 0;
  }
  if(temp=="Male"){
    A[N-1]="Male";
  }
  if(temp=="Female"){
    A[N-1]="Female";
  }
  int l=N-1;
  int r=0;
  int k=22;
  while(k){
    k--;
    int m=(l+r)/2;
    cout<<m<<endl;
    cin>>temp;
    if(temp=="Vacant"){
      cout<<m<<endl;
      return 0;
    }
    if(temp=="Male"){
      A[m]="Male";
    }
    if(temp=="Female"){
      A[m]="Female";
    }  
    if((l-m)%2 == 0 && A[l] == A[m]){
      l=m;
      continue;
    }
    if((l-m)%2 == 0 && A[l] != A[m]){
      r=m;
      continue;
    }    
    if((l-m)%2 == 1 && A[l] == A[m]){
      r=m;
      continue;
    }    
    if((l-m)%2 == 1 && A[l] != A[m]){
      l=m;
      continue;
    } 

   }
  cout<<3<<endl;

  return 0;
}

#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>; 
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}

 
int main(){
   int n ; cin>>n ;
   cout<< 0 <<endl ;
   string s ; cin >>s ;
   if(s=="Vacant") return 0 ;
   int l =0 ; int r= n ;
   while(1){
     int m = (r+l) /2 ;
     cout<< m<< endl ;
     string ss ;cin>>ss ;
     if(ss=="Vacant" ) break ;
     bool ok= (s==ss) ;
     int a = m%2 ;
     if(ok==a) r=m ;
    else l= m+1 ;

   }
 return 0 ;
}
