#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; using ll = long long;
const int N=2e3+5; using pii = pair<int,int>;
int n,col[N],vis[N],deg[N]; vector<pii> ans; vector<int> lis[N],to[N];
pii query(const vector<int>& vec){
	cout<<"? "<<vec.size()<<' '; for(int x:vec) cout<<x<<' ';; cout<<'\n'; cout.flush();
	int x,y; cin>>x>>y; return pii(x,y);
}
void rework(const vector<int>& vec){
	if(vec.empty()) return;
	int mn=vec[0]; For(i,1,vec.size()-1) if(deg[vec[i]]<deg[mn]) mn=vec[i];
	vector<int> tmp=vec; tmp.erase(find(tmp.begin(),tmp.end(),mn));
	rework(tmp);
	For(i,1,n) vis[i]=0;
	for(int v:to[mn]) vis[col[v]]=1;
	For(i,1,n) if(!vis[i]) { col[mn]=i; break; }
}
int main(){
	cin>>n; col[1]=1;
	For(u,2,n){
		For(i,1,n) lis[i].clear(),vis[i]=0;
		For(v,1,u-1) lis[col[v]].push_back(v);
		For(i,1,n) if(lis[i].size()){
			vector<int> tmp=lis[i]; tmp.push_back(u);
			while(tmp.size()>1u){
				auto pr=query(tmp);
				if(pr.first==-1||pr.second==-1) break;
				assert(pr.first==u||pr.second==u);
				int v=pr.first^pr.second^u;
				vis[col[v]]=1; ans.push_back(minmax(u,v)); to[u].push_back(v); to[v].push_back(u);
				assert(find(tmp.begin(),tmp.end(),v)!=tmp.end());
				tmp.erase(find(tmp.begin(),tmp.end(),v));
			}
		}
		//~ For(i,1,n) if(!vis[i]) { col[u]=i; break; }
		vector<int> qwq(u); iota(qwq.begin(),qwq.end(),1); For(i,1,u) deg[i]=to[i].size();
		rework(qwq);
		for(auto pr:ans) assert(col[pr.first]!=col[pr.second]);
	}
	cout<<"! "<<ans.size()<<'\n';
	for(auto pr:ans) cout<<pr.first<<' '<<pr.second<<'\n';
	return 0;
}