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

ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Pair = Tuple!(long, "x", long, "y");
alias PQueue(T, alias less = "a>b") = BinaryHeap!(Array!T, less);

void main()
{
    auto n = lread();
    long ok = -1, ng = n;
    writeln(0);
    stdout.flush();
    auto first = sread();
    if (first == "Vacant")
        return;

    long p = (first == "Male" ? 0 : 1);
    while (abs(ok - ng) > 1)
    {
        auto mid = (ok + ng) / 2;
        mid.writeln();
        stdout.flush();
        auto s = sread();

        bool check(long i, string s)
        {
            if ((i + p) % 2)
                return (s == "Female");
            else
                return (s == "Male");
        }

        if (s == "Vacant")
            return;

        if (check(mid, s))
            ok = mid;
        else
            ng = mid;

    }
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
