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

#define rep(i,l,r) for(auto i(l),i##_end(r);i<=i##_end;++i)
#define per(i,r,l) for(auto i(r),i##_end(l);i>=i##_end;--i)
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) ((int)(a).size())

using cint=const int;
using ll=long long;
using cll=const long long;
using ull=unsigned long long;
#if __SIZEOF_POINTER__==8
using lll=__int128;
#endif
using db=double;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
using vii=vector<pii>;
using vll=vector<pll>;
mt19937 rnd(random_device{}());
mt19937_64 rnd64(random_device{}());

// #define LOCAL
const int N=4005;
#ifdef LOCAL
int G[N][N];
#endif
int n;
int slf[N],d[N],g[N][N];
vi query(vi a)
{
    printf("? %d ",SZ(a));
    for(int i:a) printf("%d ",i);
    puts("");
    #ifdef LOCAL
    vi res,S;
    rep(i,0,SZ(a)-1)
    {
        int d=0;
        for(int j:S) d+=G[a[i]][j];
        res.pb(d);
        if(!d) S.pb(a[i]);
        printf("%d ",d);
    }
    puts("");
    system("pause");
    return res;
    #endif
    fflush(stdout);
    vi b(SZ(a));
    for(int &i:b) scanf("%d",&i);
    return b;
}
void solve(vi a)
{
    if (SZ(a)<=1) return;
    vi cnt(query(a));
    vi L,R;
    rep(i,0,SZ(a)-1)
        if(!cnt[i]) L.pb(a[i]);
        else R.pb(a[i]);
    if (!SZ(R)) return;
    solve(R);
    function<void(vi,vii)> seek=[&](vi L,vii R)->void
    {
        if (!SZ(L)) return;
        if (SZ(L)==1)
        {
            for(int i:L) 
                for(auto [j,d]:R)
                    g[i][j]+=d,g[j][i]+=d;
            return;
        }
        int mid=(SZ(L)-1)/2;
        vi l1,l2;
        rep(i,0,mid) l1.pb(L[i]);
        rep(i,mid+1,SZ(L)-1) l2.pb(L[i]);

        vi T(l1);
        for(auto i:R) T.pb(i.fi);
        T=query(T);
        vii r1,r2;
        rep(i,0,SZ(R)-1)
        {
            int x=R[i].fi,num=T[i+SZ(l1)];
            rep(j,0,i-1) if(!T[j+SZ(l1)]) num-=g[x][R[j].fi];
            if (num) r1.pb({x,num});
            if (R[i].se-num) r2.pb({x,R[i].se-num});
        }
        seek(l1,r1),seek(l2,r2);
    };
    a=L;
    for(int i:R) a.pb(i);
    cnt=query(a);
    vii TR;
    rep(i,0,SZ(R)-1) TR.pb({R[i],cnt[i+SZ(L)]}); 
    seek(L,TR);
}
int main()
{
    scanf("%d",&n);
    #ifdef LOCAL
    int m;
    scanf("%d",&m);
    rep(i,1,m) 
    {
        int u,v;
        scanf("%d%d",&u,&v);
        if (u==v) G[u][u]++;
        else G[u][v]++,G[v][u]++;
    }
    #endif
    rep(i,1,n) g[i][i]=query({i,i})[1];
    vi a;
    rep(i,1,n) a.pb(i);
    solve(a);
    vii ans;
    rep(i,1,n)
        rep(j,i,n)
            rep(k,1,g[i][j]) ans.pb({i,j});
    printf("! %d ",SZ(ans));
    for(pii i:ans) printf("%d %d ",i.fi,i.se);
}
/* 
5 7
1 2
1 3
2 3
2 5
3 4
3 5
4 5
 */