#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> rem(n);
  iota(rem.begin(), rem.end(), 0);
  vector<int> p;
  p.reserve(n);
  REP(i, n) {
    int lb = 0, ub = n - i;
    while (ub - lb > 1) {
      const int mid = midpoint(lb, ub);
      cout << '?';
      for (const int p_i : p) cout << ' ' << p_i + 1;
      cout << ' ' << rem[mid] + 1;
      for (const int e : rem) {
        if (e != rem[mid]) cout << ' ' << e + 1;
      }
      cout << endl;
      int ret; cin >> ret;
      assert(ret != -1);
      (ret == 1 ? lb : ub) = mid;
    }
    p.emplace_back(rem[lb]);
    rem.erase(next(rem.begin(), lb));
  }
  cout << '!';
  for (const int p_i : p) cout << ' ' << p_i + 1;
  cout << endl;
  return 0;
}