Buggy python submission (verdict: Time Limit Exceeded):
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
ret = ''
print(0)
sys.stdout.flush()
ret = sr()
manflag = True
if ret == 'Female':
    manflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1
q = (r-l)//2

while ret != 'Vacant' and r > l:
    # クエリ送信
    print(q)
    sys.stdout.flush()
    ret = sr()


    if manflag and (q-l)%2 == 1:
        if ret == 'Female':
            tmp = q
            q = q + (r - q) // 2
            l = tmp + 1
            manflag = not manflag
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif manflag and (q-l)%2 == 0:
        if ret == 'Male':
            tmp = q
            q = q + (r - q) // 2
            l = tmp + 1
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 1:
        if ret == 'Male':
            tmp = q
            q = q + (r - q) // 2
            l = tmp + 1
            manflag = not manflag
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 0:
        if ret == 'Female':
            tmp = q
            q = q + (r - q) // 2
            l = tmp+1
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
if r <= l:
    # クエリ送信
    print(r)
    sys.stdout.flush()
    ret = sr()
    if ret == 'Vacant':
        sys.exit()
    else:
        print(l)
        sys.stdout.flush()
        sys.exit()

Fixed submission:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
ret = ''

print(n-1)
sys.stdout.flush()
ret = sr()
rmanflag = True
if ret == 'Female':
    rmanflag = False
elif ret == 'Vacant':
    sys.exit()

print(0)
sys.stdout.flush()
ret = sr()
lmanflag = True
if ret == 'Female':
    lmanflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1

m = (r-l)//2

while r > l:
    print(m)
    sys.stdout.flush()
    ret = sr()
    mmanflag = True
    if ret == 'Female':
        mmanflag = False
    elif ret == 'Vacant':
        sys.exit()
    
    # 左の判定
    if (m-l)%2==0:
        if lmanflag == mmanflag:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag
        else:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
    else:
        if lmanflag == mmanflag:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
        else:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag

Buggy python submission (verdict: Time Limit Exceeded):
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
ret = ''
print(0)
sys.stdout.flush()
ret = sr()
manflag = True
if ret == 'Female':
    manflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1
q = (r-l)//2

while ret != 'Vacant' and r > l:
    # クエリ送信
    print(q)
    sys.stdout.flush()
    ret = sr()


    if manflag and (q-l)%2 == 1:
        if ret == 'Female':
            l = q+1
            q = l+(r-l)//2
            manflag = not manflag
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif manflag and (q-l)%2 == 0:
        if ret == 'Male':
            l = q+1
            q = l+(r-l)//2
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 1:
        if ret == 'Male':
            l = q+1
            q = l + (r-l)//2
            manflag = not manflag
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 0:
        if ret == 'Female':
            l = q+1
            q = l+(r-l)//2
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
if r <= l:
    # クエリ送信
    print(r)
    sys.stdout.flush()
    ret = sr()
    if ret == 'Vacant':
        sys.exit()
    else:
        print(l)
        sys.stdout.flush()
        sys.exit()

Fixed submission:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
ret = ''

print(n-1)
sys.stdout.flush()
ret = sr()
rmanflag = True
if ret == 'Female':
    rmanflag = False
elif ret == 'Vacant':
    sys.exit()

print(0)
sys.stdout.flush()
ret = sr()
lmanflag = True
if ret == 'Female':
    lmanflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1

m = (r-l)//2

while r > l:
    print(m)
    sys.stdout.flush()
    ret = sr()
    mmanflag = True
    if ret == 'Female':
        mmanflag = False
    elif ret == 'Vacant':
        sys.exit()
    
    # 左の判定
    if (m-l)%2==0:
        if lmanflag == mmanflag:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag
        else:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
    else:
        if lmanflag == mmanflag:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
        else:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag

Buggy python submission (verdict: Time Limit Exceeded):
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
pre = 0
ret = ''
print(0)
sys.stdout.flush()
ret = sr()
manflag = True
if ret == 'Female':
    manflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1
q = (r-l)//2

while ret != 'Vacant' and r > l:
    # クエリ送信
    print(q)
    sys.stdout.flush()
    ret = sr()
    
    
    if manflag and (q-l)%2 == 1:
        if ret == 'Female':
            l = q+1
            q = l+(r-l)//2
            manflag = not manflag
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif manflag and (q-l)%2 == 0:
        if ret == 'Male':
            l = q+1
            q = l+(r-l)//2
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 1:
        if ret == 'Male':
            l = q + 1
            q = l + (r - l) // 2
            manflag = not manflag
        elif ret == 'Female':
            r = q
            q = l+(r-l)//2
        else:
            sys.exit()
    elif not manflag and (q-l)%2 == 0:
        if ret == 'Female':
            l = q+1
            q = l + (r - l) // 2
        elif ret == 'Male':
            r = q
            q = l+(r-l)//2
            manflag = not manflag
        else:
            sys.exit()
if r <= l:
    # クエリ送信
    print(l)
    sys.stdout.flush()

Fixed submission:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

n = ir()
ret = ''

print(n-1)
sys.stdout.flush()
ret = sr()
rmanflag = True
if ret == 'Female':
    rmanflag = False
elif ret == 'Vacant':
    sys.exit()

print(0)
sys.stdout.flush()
ret = sr()
lmanflag = True
if ret == 'Female':
    lmanflag = False
elif ret == 'Vacant':
    sys.exit()

l = 0
r = n-1

m = (r-l)//2

while r > l:
    print(m)
    sys.stdout.flush()
    ret = sr()
    mmanflag = True
    if ret == 'Female':
        mmanflag = False
    elif ret == 'Vacant':
        sys.exit()
    
    # 左の判定
    if (m-l)%2==0:
        if lmanflag == mmanflag:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag
        else:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
    else:
        if lmanflag == mmanflag:
            r = m
            m = l+(r-l)//2
            rmanflag = mmanflag
        else:
            l = m
            m = l+(r-l)//2
            lmanflag = mmanflag