#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define INF (ll)(1e18)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }







int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    
    
    int n;
    cin >> n;
    int table[1100] = {0};
    int k = 0;
    
    rep(i, n) {
        cout << "? " << n - 1 << endl;
        rep(j, n) {
            if (j == i) continue;
            cout << j + 1 << " ";
        }
        cout << endl;
        int ans;
        cin >> ans;
        if (ans == 0) {
            table[i + 1] = 1;
            ++k;
        }
    }
    
    cout << "! " << k << endl;
    rep3(i, 1, n + 1) if (table[i] == 1) cout << i << " ";
    cout << endl;
}