Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==prev and odd_diff)or(now!=prev and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = ((m-ng)%2==1)
    if isok(m, odd_diff):
        prev=now
        ok = m
    else:
        prev=now
        ng = m

print(ok,flush=True)
exit()


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==prev and odd_diff)or(now!=prev and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = ((m-ng)%2==1)
    if isok(m, odd_diff):
        prev=now
        ok = m
    else:
        prev=now
        ng = m

print(ok)


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now!=prev and odd_diff)or(now==prev and not odd_diff):
        return True
    else:
        return False

ok = n
ng = 1
m=1
while ok - ng > 1:

    m = (ok+ng)//2
    odd_diff = ((m-ng)%2!=0)
    if isok(m, odd_diff):
        prev=now
        ok = m
    else:
        prev=now
        ng = m

print(ng)


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, should_change):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now!=prev and should_change)or(now==prev and not should_change):
        return False
    else:
        return True

ok = n
ng = 1

while ok - ng > 1:
    m = (ok+ng)//2
    should_change = (m-ng)%2!=0
    if isok(m, should_change):
        prev=now
        ok = m
    else:
        prev=now
        ng = m


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, should_change):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now!=prev and should_change)or(now==prev and not should_change):
        return True
    else:
        return False

ok = n
ng = 1

while ok - ng > 1:
    m = (ok+ng)//2
    should_change = (m-ng)%2!=0
    if isok(m, should_change):
        prev=now
        ok = m
    else:
        prev=now
        ng = m


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()

now=[]

def isok(ans, should_change):
    print(ans,flush=True)
    now = input()

    if (now!=prev and should_change)or(now==prev and not should_change):
        return True
    else:
        return False

ok = n
ng = 1

while ok - ng > 1:
    m = (ok+ng)//2
    should_change = (m-ng)%2!=0
    if isok(m, should_change):
        prev=now
        ok = m
    else:
        prev=now
        ng = m


Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
MOD = n

print(0, flush=True)
in_prev = 0
s = input()
if s == 'Vacant':exit()
else: in_prev = s
    out_prev = 0
    out_now = n//2

opp=-1
step = (n-1)//2
for j in range(19):

    s = input()


    if s == 'Vacant':
        exit()

    elif in_prev == s:

        tmp = out_prev+out_now
        if tmp %2==0:
            opp = True
            if out_prev == 0:
                out_prev = n
                tmp = out_prev+out_now+1
            else:
                tmp = out_prev+out_now
            out_prev = out_now
            out_now = tmp//2
            print(out_now, flush=True)
        else:
            opp = False
            tmp = out_prev+out_now
            out_prev = out_now
            out_now = tmp//2
            print(out_now, flush=True)

    else:

        tmp = out_prev+out_now
        if tmp %2!=0:
            opp = True
            if out_prev == 0:
                out_prev = n
                tmp = out_prev+out_now+1
            else:
                tmp = out_prev+out_now
            out_prev = out_now
            out_now = tmp//2
            print(out_now, flush=True)
        else:
            opp = False
            tmp = out_prev+out_now
            out_prev = out_now
            out_now = tmp//2
            print(out_now, flush=True)



Fixed submission:
n = int(input())
print(0,flush=True)

prev = input()
if prev=='Vacant': exit()
zero = prev
now=[]

def isok(ans, odd_diff):
    print(ans,flush=True)
    now = input()

    if now == 'Vacant': exit()

    if (now==zero and odd_diff)or(now!=zero and not odd_diff):
        return True
    else:
        return False

ok = n-1 #ok以前にVacantが存在
ng = 0 #ng以前にVacantは存在しない

while ok - ng > 1:
    m = (ok+ng)//2
    odd_diff = (m%2==1)
    if isok(m, odd_diff):
        ok = m
    else:
        ng = m

print(ok,flush=True)
exit()