from collections import deque
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

n=int(input())
hit=deque()

def q(x):
    lst=list(range(1,x+1))
    print("?",len(lst)+len(hit))
    print(*lst,*hit)

def main():
    l=0
    r=n+1
    while l + 1 < r:
        m = (l + r) // 2
        q(m)
        if input() == "0":
            l = m
        else:
            if m==2:
                print("!",2)
                print(1,2)
                exit()
            r = m
    hit.append(r)
    for x in range(r-1,0,-1):
        q(x-1)
        if input()=="0":
            hit.appendleft(x)
    print("!",len(hit))
    print(*hit)

main()