#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef vector<int> vi;
#define pb push_back

int ans[100000];
int query(vi v) {
    int z;
    cout << "? " << v.size();
    for (int z: v) cout << " " << z+1;
    cout << endl;
    cin >> z;
    return z; 
}
int main() {
    int n;
    cin >> n;

    vi things;
    int c = 0;
    fill(ans,ans+n,-1);
    while (c+3 < n) {
        vi u;
        if (!things.empty()) u.pb(things.back()),things.pop_back();
        auto clean = [&]() {
            int i;
            int o = u[0];
            for (i = (int) things.size()-1; i >= 0; i--) {
                ans[things[i]] = 1-ans[o];
                o = things[i];
            }
            things.clear();
        };
        while (u.size() < 4) u.pb(c++);
        int z = query({u[0],u[1],u[2]});
        if ((z == 0) || (z == 3)) {
            ans[u[0]] = ans[u[1]] = ans[u[2]] = z/3,c--;
            clean();
            continue;
        }
        int y = query({u[2],u[3]});
        if ((y == 0) || (y == 2)) {
            ans[u[2]] = ans[u[3]] = y/2;
            if ((z-ans[u[2]] == 0) || (z-ans[u[2]] == 2)) {
                ans[u[0]] = ans[u[1]] = (z-ans[u[2]])/2;
                clean();
                continue;
            }
            else {
                things.pb(u[0]);
                things.pb(u[1]);
                continue;
            }
        }
        int x = query({u[1],u[3]});
        ans[u[0]] = (z+x-1) & 1;
        ans[u[1]] = ((z+x-1) & 2) >> 1;
        ans[u[2]] = z-ans[u[0]]-ans[u[1]];
        ans[u[3]] = 1-ans[u[2]];
        clean();
    }
    while (c < n) ans[c] = query({c}),c++;
    if (!things.empty()) {
        int i;
        ans[things[0]] = query({things[0]});
        for (i = 1; i < things.size(); i++) ans[things[i]] = 1-ans[things[i-1]];
    }
    int i;
    cout << "= ";
    for (i = 0; i < n; i++) cout << ans[i];
    cout << endl;

    return 0;
}