#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


struct Interactive{
  vector<int> answer;
  int n;
  
  Interactive(int n): n(n){
    static mt19937 rand(time(0));

    REP(i,n){
      if(rand() % 2 == 0){
        answer.push_back(i+1);
      }
    }
  }

  bool query(vector<int> q){
    sort(ALL(q));
    
    cout << "? " << q.size() << endl;
    join(cout, ALL(q));
    
#ifdef DEBUG
    vector<bool> check(n);
    for(auto x : q){
      check[x-1] = true;
    }

    for(auto x : answer){
      if(not check[x-1]) return false;
    }

    return true;
#else
    int ret; cin >> ret;
    return ret;
#endif
  }

  void ans(vector<int> a){
    cout << "! " << a.size() << endl;
    join(cout, ALL(a));

    dump(answer);
  }
};





int main(){
  int N; cin >> N;

  vector<int> check(N);
  vector<int> ans;

  Interactive inter(N);


  FORE(i,1,N-2){
    vector<int> temp(ans);

    FORE(j,i+1,N){
      temp.push_back(j);
    }

    bool res = inter.query(temp);

    if(!res){
      ans.push_back(i);
    }
  }

  if(ans.size() == 0){
    ans.push_back(N-1);
    ans.push_back(N);
  }else{
    {
      vector<int> temp;
      FORE(i,1,N-2) temp.push_back(i);
      temp.push_back(N);
      if(not inter.query(temp)){
        ans.push_back(N-1);
      }
    }

    {
      vector<int> temp;
      FORE(i,1,N-1) temp.push_back(i);
      if(not inter.query(temp)){
        ans.push_back(N);
      }
    }
  }
  
  

  inter.ans(ans);

  return 0;
}