Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w1 = input()
if w1 == 'Vacant':
    exit()

l, r = 0, N - 1
while r - l > 1:
    m = (l + r) // 2
    print(m, flush=True)
    w2 = input()
    if w2 == 'Vacant':
        break
    if w1 == w2:
        l, r = (l, m) if (m - l) & 1 else (m + 1, r)
    else:
        l, r = (m + 1, r) if (m - l) & 1 else (l, m)
    w1 = w2
print(l, flush=True)


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w1 = input()
if w1 == 'Vacant':
    exit()

l, r = 0, N - 1
while r - l > 1:
    m = (l + r) // 2
    print(m, flush=True)
    w2 = input()
    if w2 == 'Vacant':
        break
    if w1 == w2:
        l, r = (l, m) if (m - l) & 1 else (m + 1, r)
    else:
        l, r = (m + 1, r) if (m - l) & 1 else (l, m)
    w1 = w2
print(l, flush=True)
input()



Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w1 = input()
if w1 == 'Vacant':
    exit()

l, r = 0, N - 1
while r - l > 1:
    m = (l + r) // 2
    print(m, flush=True)
    w2 = input()
    if w2 == 'Vacant':
        break
    if w1 == w2:
        l, r = (l, m) if (m - l) & 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) & 1 else (l, m)
    w1 = w2


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w1 = input()
if w1 == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m, flush=True)
    w2 = input()
    if w2 == 'Vacant':
        exit()

    if w1 == w2:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    w1 = w2
print((l + r) // 2, flush=True)
exit()


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
import sys
N = int(input())

s = [] * 2
print(0)
sys.stdout.flush()
s[0] = input()
if s[0] == 'Vacant':
    sys.exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m)
    sys.stdout.flush()
    s[1] = input()
    if s[1] != 'Vacant':
        sys.exit()

    if s[0] == s[1]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    s[0] = s[1]
print((l + r) // 2)
sys.stdout.flush()
sys.exit()


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

s = [] * 2
print(0, flush=True)
s[0] = input()
if s[0] == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m, flush=True)
    s[1] = input()
    if s[1] != 'Vacant':
        exit()

    if s[0] == s[1]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    s[0] = s[1]
print((l + r) // 2, flush=True)
exit()


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

s = [] * 2
print(0, flush=True)
s[0] = input()
if s[0] == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m, flush=True)
    s[1] = input()
    if s[1] != 'Vacant':
        exit()

    if s[0] == s[1]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    s[0] = s[1]
print(l + 1, flush=True)


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

s = [] * 2
print(0, flush=True)
s[0] = input()
if s[0] == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m, flush=True)
    s[1] = input()
    if s[1] != 'Vacant':
        exit()

    if s[0] == s[1]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    s[0] = s[1]
print(m + 1, flush=True)


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

s = []
print(0, flush=True)
s.append(input())
if s[-1] == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m, flush=True)
    s.append(input())
    if s[-1] != 'Vacant':
        exit()

    if s[i - 1] == s[i]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
print(m + 1, flush=True)


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
N = int(input())

s = []
print(0)
s.append(input())
if s[-1] == 'Vacant':
    exit()

l, r = 0, N
while r - l > 2:
    m = (l + r) // 2
    print(m)
    s.append(input())
    if s[-1] != 'Vacant':
        exit()

    if s[i - 1] == s[i]:
        l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
    else:
        l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
print(m + 1)


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
N = int(input())

def solve():
    s = []
    print(0)
    s.append(input())
    if s[-1] == 'Vacant':
        return

    l, r = 0, N
    while r - l > 1:
        m = (l + r) // 2
        print(m)
        s.append(input())
        if s[-1] != 'Vacant':
            return

        if s[i - 1] == s[i]:
            l, r = (l, m) if (m - l) % 2 == 1 else (m, r)
        else:
            l, r = (m, r) if (m - l) % 2 == 1 else (l, m)
    print(m + 1)

print(solve())


Fixed submission:
#!/usr/bin/env python3
N = int(input())

print(0, flush=True)
w0 = input()
if w0 == 'Vacant':
    exit()

l, r = 0, N
while True:
    m = (l + r) // 2
    print(m, flush=True)
    w1 = input()
    if w1 == 'Vacant':
        break
    if m % 2 == (w0 != w1):
        l = m
    else:
        r = m