#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n, ans;
    cin >> n;

    vector<int> a;
    int cnt = 0;
    for(int i=0;i<n;++i) {
        cout << "? " << n-1 << endl;
        cout << ((i==0)?2:1);
        for(int j=((i==0)?2:1);j<n;++j) {
            if(i != j) {
                cout << " " << j+1;
            }
        }
        cout << endl;
        cin >> ans;
        if(ans == 0) a.push_back(i);
        cnt += 1-ans;
    }

    cout << "! " << cnt << endl;
    cout << a[0]+1;
    for(int i=1;i<a.size();++i) cout << " " << a[i]+1;
    cout << endl;
}