import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;
static import std.ascii;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();

    writeln(0);
    stdout.flush();
    auto s = sread();
    if (s == "Vacant")
        return;
    long z = (s == "Male") ? 0 : 1;
    long ok = 0;
    long ng = N - 1;

    while (1 < (ng - ok))
    {
        long x = (ok + ng) / 2;
        writeln(x);
        stdout.flush();
        s = sread();
        if (s == "Vacant")
            return;
        long g = (s == "Male") ? 0 : 1;
        if ((x & 1) == (z ^ g))
        {
            ok = x;
        }
        else
        {
            ng = x;
        }
    }
    writeln(ng);
    stdout.flush();
    s = sread();
    if (s == "Vacant")
        return;
}
