#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n+1] = {};
    int k = 0;
    srep(i,1,n+1){
        cout << "? " << n - 1 << endl;
        int cnt = 0;
        srep(j,1,n+1){
            if(j != i){
                cout << j;
                cnt++;
                if(j < n-1){
                    cout << ' ';
                }else{
                    cout << endl;
                }
            }
        }
        fflush(stdout);
        int x; cin >> x;
        if(x == 0){
            a[i] = 1;
            k++;
        }
    }
    cout << "! " << k << endl;
    rep(i,n+1){
        if(a[i] == 1){
            cout << i;
            k--;
            if(k == 0){
                cout << endl;
            }else{
                cout << ' ';
            }
        }
    }
    return 0;
}