MOD = 10 ** 9 + 7
INF = 10 ** 12
import sys
sys.setrecursionlimit(1000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  itertools import permutations
from math import gcd

def main():
    n = int(input())
    a = list(range(1,n + 1))
    ans = []
    for j in range(1,n + 1):
        print("? {}".format(n - 1),flush = True)
        print(' '.join([str(i) for i in a if i != j]))
        rep = int(input())
        if rep == 0:
            ans.append(str(j))
    
    print("! {}".format(len(ans)))
    print(' '.join(ans))

if __name__ =='__main__':
    main()