// Not afraid to dark.

#include <bits/stdc++.h>
using namespace std;

#define inline __inline__ __attribute__ ((always_inline))

namespace io {
	int pos;
	inline int read (int &p = pos){
		static int v; static char c;
		v = 1, c = getchar (), p = 0;
		while (! isdigit (c)){
			if (c == '-')
				v = - 1;
			c = getchar ();
		}
		while (isdigit (c)){
			p = (p << 1) + (p << 3) + (c - 48);
			c = getchar ();
		}
		return p *= v;
	}
	inline void write (int x){
		if (x < 0)
			putchar ('-'), x = - x;
		static int sta[65], top;
		top = 0;
		do {
			sta[++ top] = x % 10;
			x /= 10;
		} while (x);
		while (top)
			putchar (sta[top --] + 48);
	}
	inline char next_char (){
		static char c;
		c = getchar ();
		while (c == '\n' || c == ' ' || c == '\r')
			c = getchar ();
		return c;
	}
	inline void putss (const string s){
		for (int i = 0;i < (int) s.size ();++ i)
			putchar (s[i]);
	}
};

const int N = 1e3;

int n;
inline int QUERY (const int l, const int r){
	assert (1 <= l && l <= r && r <= n);
	io::putss ("? "), io::write (l), putchar (' '), io::write (r), putchar ('\n'); fflush (stdout);
	return io::read ();
}

struct Suffix_Automaton {
	int sz, link[N * 2 + 5], len[N * 2 + 5], las, dif;
	map < int , int > nex[N * 2 + 5];
	inline void init (){ sz = 1; link[0] = - 1; len[0] = las = dif = 0; nex[0].clear (); }
	inline void extend (int c){
		static int p, q, cur, clone;
		len[cur = sz ++] = len[p = las] + 1;
		nex[cur].clear ();
		while (p != - 1 && nex[p][c] == 0){
			nex[p][c] = cur;
			p = link[p];
		}
		if (p != - 1){
			q = nex[p][c];
			if (len[q] == len[p] + 1)
				link[cur] = q;
			else {
				clone = sz ++;
				len[clone] = len[p] + 1;
				nex[clone] = nex[q];
				link[clone] = link[q];
				dif -= len[q] - len[link[q]];
				while (p != - 1 && nex[p][c] == q){
					nex[p][c] = clone;
					p = link[p];
				}
				link[q] = link[cur] = clone;
				dif += len[q] - len[link[q]];
				dif += len[clone] - len[link[clone]];
			}
		} else
			link[cur] = 0;
		dif += len[cur] - len[link[cur]];
		las = cur;
	}
	Suffix_Automaton (){ init (); }
} sam[N + 5];
int a[N + 5];

signed main (){
	io::read (n);
	a[1] = 1;
	sam[1].extend (1);
	for (int i = 2, l, r, mid, cnt = 1;i <= n;++ i){
		l = 1, r = i;
		while (l < r){
			mid = (l + r) >> 1;
			if (QUERY (mid, i) - sam[mid].dif != i - mid + 1)
				l = mid + 1;
			else
				r = mid;
		}
		if (l == 1) a[i] = ++ cnt;
		else a[i] = a[l - 1];
		for (int j = 1;j <= i;++ j)
			sam[j].extend (a[i]);
	}
	io::putss ("! ");
	for (int i = 1;i <= n;++ i)
		io::write (a[i]), putchar (' ');
	putchar ('\n'); fflush (stdout);
	return 0;
}