#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n;
    cin>>n;
    stack<array<int,4>>st;
    vector<array<int,2>>ans;
    for(int i=n-2;i>=0;i--){
        st.push({i,i+1,n-1,0});
    }
    int q=0;
    while(!st.empty()){
        array<int,4>tmp=st.top();
        st.pop();
        if(q>4500)return 1;
        q++;
        cout<<"? 1 "<<tmp[2]-tmp[1]+1<<" "<<tmp[0]+1<<" ";
        for(int i=tmp[1];i<=tmp[2];i++){
            cout<<i+1<<(i!=tmp[2]?" ":"");
        }
        cout<<endl;
        int a;
        cin>>a;
        if(a==-1)return 1;
        if(a){
            if(tmp[2]==tmp[1]){
                ans.push_back({tmp[0],tmp[1]});
            }else{
                st.push({tmp[0],tmp[1],(tmp[1]+tmp[2])/2,0});
                st.push({tmp[0],(tmp[1]+tmp[2])/2+1,tmp[2],1});
            }
        }else if(tmp[3]==1){
            tmp=st.top();
            st.pop();
            if(tmp[2]==tmp[1]){
                ans.push_back({tmp[0],tmp[1]});
            }else{
                st.push({tmp[0],tmp[1],(tmp[1]+tmp[2])/2,0});
                st.push({tmp[0],(tmp[1]+tmp[2])/2+1,tmp[2],1});
            }
        }
    }
    cout<<"! "<<ans.size()<<endl;
    for(int i=0;i<ans.size();i++){
        cout<<ans[i][0]+1<<" "<<ans[i][1]+1<<endl;
    }
    return 0;
}