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

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<22;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
};

class FastOutput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
 protected:
	inline void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE)flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	inline void __write(T x)
	{
		static char stk[64],*top;top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f){}
#ifdef OPENIOBUF
	inline void setTarget(FILE *f) { this->flush(),target=f; }
	~FastOutput(){ flush(); }
#else
	inline void setTarget(FILE *f) { target=f; }
#endif
	template<typename ...T>
	inline void writesp(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	inline void writeln(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	inline FastOutput &operator <<(char x)
		{ return __putc(x),*this; }
	inline FastOutput &operator <<(const char *s)
		{ for(;*s;__putc(*(s++)));return *this; }
	inline FastOutput &operator <<(const string &s)
		{ return (*this)<<s.c_str(); }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastOutput &operator <<(const T &x)
		{ return __write(x),*this; }
}qout;

class FastInput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ buf[fread(buf,1,BUFSIZE,target)]='\0',buf_p=0; }
#endif
 protected:
	inline char __getc()
	{
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		return buf[buf_p++];
#else
		return getc(target);
#endif
	}
 public:
#ifdef OPENIOBUF
	FastInput(FILE *f=stdin): FastIOBase(f){ buf_p=BUFSIZE; }
	inline void setTarget(FILE *f) { this->flush(),target=f; }
#else
	FastInput(FILE *f=stdin): FastIOBase(f){}
	inline void setTarget(FILE *f) { target=f; }
#endif
	inline char getchar() { return __getc(); }
	template<typename ...T>
	inline void read(T &...x)
		{ initializer_list<int>{(this->operator>>(x),0)...}; }
	inline FastInput &operator >>(char &x)
		{ while(isspace(x=__getc()));return *this; }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastInput &operator >>(T &x)
	{
		static char ch,sym;x=sym=0;
		while(isspace(ch=__getc()));
		if(ch=='-') sym=1,ch=__getc();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=__getc());
		return sym?x=-x:x,*this;
	}
	inline FastInput &operator >>(char *s)
	{
		while(isspace(*s=__getc()));
		for(;!isspace(*s) && *s && ~*s;*(++s)=__getc());
		return *s='\0',*this;
	}
	inline FastInput &operator >>(string &s)
	{
		char str_buf[(1<<8)+1],*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=__getc()));
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=__getc()) && *p && ~*p;p++);
			*p='\0',s.append(str_buf);
			if(p!=buf_end) break;
		}
		return *this;
	}
}qin;

} // namespace FastIO
using namespace FastIO;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#else
#define FILEIO(file)
#endif

int n,m,k,deg[2005],col[2005];
bool vis[2005];
vector<int> p[2005],g[2005],_g[2005];

mt19937 mt_rnd(19260817);//chrono::system_clock::now().time_since_epoch().count());
inline pair<int,int> ask(const vector<int> &p)
{
	int u,v;
	qout<<"? "<<p.size()<<' ';
	for(auto &i: p) qout<<i<<' ';
	qout<<'\n',fflush(stdout);
#ifdef DADALZY
	set<int> s;
	vector<pair<int,int>> vec;
	for(auto &u: p) s.insert(u);
	for(auto &u: p) for(auto &v: _g[u])
	{
		if(!s.count(v)) continue;
		if(u>v) continue;
		vec.emplace_back(u,v);
	}
	if(vec.empty()) u=v=-1;
	else tie(u,v)=vec[mt_rnd()%vec.size()];
	return qout<<u<<' '<<v<<'\n',make_pair(u,v);
#else
	return qin>>u>>v,make_pair(u,v);
#endif
}
inline void answer(const vector<pair<int,int>> &e)
{
	qout<<"! "<<e.size()<<'\n';
	for(auto &[u,v]: e) qout<<u<<' '<<v<<'\n';
	fflush(stdout);
}
int main()
{
	qin>>n;
#ifdef DADALZY
	qin>>m;
	for(int i=1,u,v;i<=m;i++)
	{
		qin>>u>>v;
		_g[u].push_back(v);
		_g[v].push_back(u);
	}
#endif
	k=1,p[1].push_back(1);
	for(int x=2;x<=n;x++)
	{
		for(int j=1;j<=k;j++)
		{
			vector<int> now(move(p[j]));
			now.push_back(x);
			while(now.size()>1)
			{
				auto [u,v]=ask(now);
				if(u==-1 && v==-1) break;
				assert(u==x || v==x);
				g[u].push_back(v);
				g[v].push_back(u);
				now.erase(find(now.begin(),now.end(),u+v-x));
			}
		}
		priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>> q;
		stack<int> ord;
		for(int i=1;i<=x;i++) deg[i]=g[i].size(),vis[i]=false;
		for(int i=1;i<=x;i++) q.emplace(deg[i],i);
		k=0;
		while(!q.empty())
		{
			auto [d,u]=q.top();q.pop();
			if(vis[u]) continue;
			k=max(k,d+1),vis[u]=true,ord.push(u);
			for(auto &v: g[u])
			{
				if((--deg[v])>=k) continue;
				if(vis[v]) continue;
				q.emplace(deg[v],v);
			}
		}
		while(!ord.empty())
		{
			int u=ord.top();ord.pop();
			vector<bool> vis(k+1);
			vis[u]=false,col[u]=1;
			for(auto &v: g[u]) if(!vis[v]) vis[col[v]]=true;
			while(vis[col[u]]) col[u]++;
			p[col[u]].push_back(u);
		}
	}
	vector<pair<int,int>> ans;
	for(int u=1;u<=n;u++)
		for(auto &v: g[u])
			if(u<v) ans.emplace_back(u,v);
	answer(ans);
	return 0;
}