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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    int n;
    cin >> n;
    vector<bool> ans(n,false);
    for (int i = 0;i < n;++i) {
        vector<int> q;
        for (int j = 0;j < i;++j) q.push_back(j);
        for (int j = i+1;j < n;++j) q.push_back(j);
        int m = q.size();
        cout << "? "<< m << "\n";
        for (int j = 0;j < m;++j) cout << q[j]+1 << " \n"[j == m-1];
        cout << flush;
        int a;
        cin >> a;
        if (a == 0) ans[i] = true;
    }
    vector<int> b;
    for (int i = 0;i < n;++i) if (ans[i]) b.push_back(i);
    int k = b.size();
    cout << "! " << k << "\n";
    for (int i = 0;i < k;++i) cout << b[i]+1 << " \n"[i == k-1];
    return 0;
}