import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

from functools import lru_cache

@lru_cache(None)
def grundy(a):
    if a == 0: return 0
    st = set()
    for l in range(a):
        r = a-1-l
        if r < l: break
        st.add(grundy(l) ^ grundy(r))
    for l in range(a):
        r = a-2-l
        if r < l: break
        st.add(grundy(l) ^ grundy(r))
    for g in range(a+1):
        if g not in st: return g

n = II()
s = [(1, n+1)]
g = grundy(n)

def check(d):
    for i, (l, r) in enumerate(s):
        cur = grundy(r-l)
        for a in range(r-l):
            b = r-l-d
            if a > b: break
            if g ^ cur ^ grundy(a) ^ grundy(b) == 0:
                del s[i]
                if a: s.append((l, l+a))
                if r-l-a-d: s.append((l+a+d, r))
                return l+a
    return -1

def update():
    k, x = LI()
    for i, (l, r) in enumerate(s):
        if l <= x < r:
            del s[i]
            if x-l: s.append((l, x))
            if r-x-k: s.append((x+k, r))
            return grundy(r-l)^grundy(x-l)^grundy(r-x-k)

while 1:
    # print(s)
    ret = check(1)
    if ret != -1:
        print(1, ret, flush=True)
        # print(s)
        t = II()
        if t == 0: exit()
        g=update()
        continue

    ret = check(2)
    if ret != -1:
        print(2, ret, flush=True)
        # print(s)
        t = II()
        if t == 0: exit()
        g=update()