N = int(input())

def dfs(l, r, cnt):
    if l == r:
        return l*cnt
    ans = 0
    mid = (l+r)//2
    print(M, mid-l+1)
    print(*list(range(l, mid+1)))
    n = int(input())
    if 1 <= n:
        ans += dfs(l, mid, n)
    if n < cnt:
        ans += dfs(mid+1, r, cnt-n)
    return ans

M = N+1
print(dfs(1, N, 5))