#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = mod - (inv[mod % i] * (mod / i));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }

}

mint nCk(ll n, ll k) {
    if (n < k||k<0) return 0;
    return fact[n] * (factinv[k] * factinv[n - k]);
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    cin>>N;
    vector<bool> U(N,true);
    int cnt=N;
    for(int i=0;i<N;i++){
        U[i]=0;
        cnt--;
        if(cnt==1){
            U[i]=1;
            cnt++;
            continue;
        }
        cout<<"? "<<cnt<<endl;
        int p=0;
        for(int k=0;k<N;k++){
            if(U[k]){
                cout<<k+1;
                if(p==cnt-1)cout<<endl;
                else cout<<" ";
                p++;
            }
        }
        int r;
        cin>>r;
        if(r==0){
            U[i]=1;
            cnt++;
        }
    }
    cout<<"! "<<cnt<<endl;
    int p=0;
        for(int k=0;k<N;k++){
            if(U[k]){
                cout<<k+1;
                
                if(p==cnt-1)cout<<endl;
                else cout<<" ";
                p++;
            }
        }
    
}