#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<P> ans;
  rep(i, n) {
    VI cand;
    for (int j = i + 1; j < n; j++) {
      cand.emplace_back(j);
    }
    auto ask = [&](int l, int r) {
      cout << "? " << 1 << ' ' << r - l << ' ' << i + 1;
      for (int x : span(cand).subspan(l, r - l)) cout << ' ' << x + 1;
      cout << endl;
      int res;
      cin >> res;
      assert(res >= 0);
      return res;
    };
    while (cand.size()) {
      int l = 0, r = cand.size();
      if (ask(l, r)) {
        while (r - l > 1) {
          int c = (l + r) / 2;
          (ask(l, c) ? r : l) = c;
        }
        ans.emplace_back(i, cand[l]);
        cand.erase(cand.begin() + l);
      }
    }
  }
  cout << "! " << ans.size() << '\n';
  for (auto [i, j] : ans) cout << i + 1 << ' ' << j + 1 << '\n';
}