#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ld = long double;
ll mod = 998244353;
ll gcd(ll a, ll b) {
  if (a == 0 or b == 0) return a + b;
  return gcd(b, a % b);
}
ll sum(ll a, ll b) {
  a += b;
  a %= mod;
  return a;
}
ll sub(ll a, ll b) {
  a += mod - b;
  a %= mod;
  return a;
}
ll mul(ll a, ll b) { return a * b % mod; }
ll pew(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b /= 2;
  }
  return res;
}
int parent[100001];
int rnk[100001];
void make_set(int v) {
  parent[v] = v;
  rnk[v] = 0;
}
int find_set(int v) {
  if (v == parent[v]) return v;
  return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
  a = find_set(a);
  b = find_set(b);
  if (a != b) {
    if (rnk[a] < rnk[b]) swap(a, b);
    parent[b] = a;
    if (rnk[a] == rnk[b]) ++rnk[a];
  }
}
vector<ll> ans;
void rec(ll l, ll r) {
  while (ans[l] != 0) {
    l++;
    if (l > r) return;
  }
  while (ans[r] != 0) {
    r--;
    if (l > r) return;
  }
  cout << "? " << l + 1 << " " << r + 1 << endl;
  ll x, k;
  cin >> x >> k;
  if (k == r - l + 1) {
    for (int i = l; i <= r; i++) {
      ans[i] = x;
    }
    return;
  }
  for (int i = r - k + 1; i <= l + k - 1; i++) {
    ans[i] = x;
  }
  rec(l, (r + l) / 2);
  rec((r + l) / 2 + 1, r);
}
int main() {
  ios_base::sync_with_stdio(false);
  ll n;
  cin >> n;
  ans.resize(n);
  rec(0, n - 1);
  cout << "! ";
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
