#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int LOG = 12;

struct SparseTable
{
	VI t[LOG];
	
	void push_back(int v)
	{
		int i = SZ(t[0]);
		t[0].PB(v);
		FOR (j, 0, LOG - 1)
			t[j + 1].PB(min(t[j][i], t[j][max(0, i - (1 << j))]));
	}
	int query(int l, int r)
	{
		assert(l < r && r <= SZ(t[0]));
		int i = 31 - __builtin_clz(r - l);
		return min(t[i][r - 1], t[i][l + (1 << i) - 1]);
	}
};

void countSort(VI& p, const VI& c)
{
	int n = SZ(p);
	VI cnt(n);
	FOR (i, 0, n)
		cnt[c[i]]++;
	VI pos(n);
	FOR (i, 1, n)
		pos[i] = pos[i - 1] + cnt[i - 1];
	VI p2(n);
	for (auto x : p)
	{
		int i = c[x];
		p2[pos[i]++] = x;
	}
	p = p2;
}

VI suffixArray(VI s)
{
	s.PB(-1);
	int n = SZ(s);
	VI p(n), c(n);
	iota(ALL(p), 0);
	sort(ALL(p), [&](int i, int j)
	{
		return s[i] < s[j];
	});
	int x = 0;
	c[p[0]] = 0;
	FOR (i, 1, n)
	{
		if (s[p[i]] != s[p[i - 1]])
			x++;
		c[p[i]] = x;
	}
	int k = 0;
	while ((1 << k) < n)
	{
		FOR (i, 0, n)
			p[i] = (p[i] - (1 << k) + n) % n;
		countSort(p, c);
		VI c2(n);
		PII pr = {c[p[0]], c[(p[0] + (1 << k)) % n]};
		FOR (i, 1, n)
		{
			PII nx = {c[p[i]], c[(p[i] + (1 << k)) % n]};
			c2[p[i]] = c2[p[i - 1]];
			if (pr != nx)
				c2[p[i]]++;
			pr = nx;
		}
		c = c2;
		k++;
	}
	p.erase(p.begin());
	return p;
}

struct LCP
{
	int n;
	VI s, sa, rnk, lcp;
	SparseTable st;
	
	LCP(VI _s): n(SZ(_s)), s(_s)
	{
		sa = suffixArray(s);
		rnk.resize(n);
		FOR (i, 0, n)
			rnk[sa[i]] = i;
		lcpArray();
		FOR (i, 0, n - 1)
			st.PB(lcp[i]);
	}
	void lcpArray()
	{
		lcp.resize(n - 1);
		int h = 0;
		FOR (i, 0, n)
		{
			if (h > 0)
				h--;
			if (rnk[i] == 0)
				continue;
			int j = sa[rnk[i] - 1];
			for (; j + h < n && i + h < n; h++)
			{
				if (s[j + h] != s[i + h])
					break;
			}
			lcp[rnk[i] - 1] = h;
		}
	}
	int queryLcp(int i, int j)
	{
		if (i == n || j == n)
			return 0;
		assert(i != j);
		i = rnk[i];
		j = rnk[j];
		if (i > j)
			swap(i, j);
		return st.query(i, j);
	}
	
	// [l, r];
	LL query(int l, int r)
	{
		LL sz = r - l + 1;
		LL ans = sz * (sz + 1) / 2 + sz + 1;
		int last = -1;
		FOR (j, 0, n)
		{
			if (l <= sa[j] && sa[j] <= r)
			{
				if (last != -1)
					ans -= queryLcp(last, sa[j]);
				last = sa[j];
			}
		}
		return ans;
	}
};

LL ask(int l, int r)
{
	cout << "? " << l + 1 << ' ' << r + 1 << endl;
	LL ans;
	cin >> ans;
	return ans;
}

int main()
{
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	
	int n;
	cin >> n;
	int cur = 2;
	VI ans(1, 1);
	FOR (i, 1, n)
	{
		LCP lcp(ans);
		int l = -1, r = i;
		while (l + 1 < r)
		{
			int m = (l + r) / 2;
			LL ansQ = ask(m, i);
			LL ansLcp = lcp.query(m, i - 1);
			if (ansQ == ansLcp)
				r = m;
			else
				l = m;
		}
		if (l == -1)
			ans.PB(cur++);
		else
			ans.PB(ans[l]);
	}
	cout << "!";
	FOR (i, 0, n)
		cout << ' ' << ans[i];
	cout << endl;
	
	return 0;
}