#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5 + 5;

int n;

#ifdef He_Ren

//mt19937_64 gen((unsigned long long)new char ^ time(0));
mt19937_64 gen(0);

int p[MAXN];

void init(void)
{
	for(int i=1; i<=n; ++i)
		p[i] = (i+1) / 2;
	shuffle(p+1, p+n+1, gen);
}

array<int,2> ask(int x,int y)
{
	printf("ask %d %d\n",x,y);
	if(gen() % 2) swap(p[x], p[y]);
	array<int,2> res = {p[x], p[y]};
	if(gen() % 2) swap(p[x], p[y]);
	return res;
}

void answer(int ans[])
{
	printf("  p: ");
	for(int i=1; i<=n; ++i)
		printf("%d ",p[i]);
	printf("\n");
	
	printf("ans: ");
	for(int i=1; i<=n; ++i)
		printf("%d ",ans[i]);
	printf("\n");
}

#else

void init(void)
{
	
}

array<int,2> ask(int x,int y)
{
	printf("? %d %d\n",x,y);
	fflush(stdout);
	array<int,2> res;
	scanf("%d%d",&res[0],&res[1]);
	return res;
}

void answer(int ans[])
{
	printf("! ");
	for(int i=1; i<=n; ++i)
		printf("%d ",ans[i]);
	printf("\n");
	fflush(stdout);
}

#endif

array<int,2> a[MAXN * 2], b[MAXN * 2];
vector<int> pos[MAXN];

int main(void)
{
	scanf("%d",&n);
	
	init();
	
	for(int i=1; i<=n/2; ++i)
	{
		a[i] = {2*i-1, 2*i};
		b[i] = ask(a[i][0], a[i][1]);
		pos[b[i][0]].emplace_back(i);
		pos[b[i][1]].emplace_back(i);
	}
	
	auto change = [&] (int i,int x,int y)
	{
		if(pos[i][0] == x) pos[i][0] = y;
		if(pos[i][1] == x) pos[i][1] = y;
	};
	
	static int ans[MAXN];
	for(int i=1; i<=n/2; ++i)
	{
		int x = pos[i][0], y = pos[i][1];
		if(x == y)
		{
			ans[a[x][0]] = ans[a[x][1]] = i;
			continue;
		}
		if(b[x][1] == i) swap(b[x][0], b[x][1]);
		if(b[y][1] == i) swap(b[y][0], b[y][1]);
		
		while(1)
		{
			auto cur = ask(a[x][0], a[y][0]);
			if((cur[0] == i) == (cur[1] == i))
			{
				if(cur[0] != i)
				{
					swap(a[x][0], a[x][1]);
					swap(a[y][0], a[y][1]);
				}
				
				change(b[x][1], x, y);
				swap(a[x][1], a[y][0]);
				swap(b[x][1], b[y][0]);
				pos[i] = {x, x};
				break;
			}
			
			cur = ask(a[x][0], a[x][1]);
			if((cur[0] == i) == (cur[1] == i))
			{
				if(cur[0] != i)
				{
					swap(x, y);
				}
				
				change(b[x][1], x, y);
				swap(b[x][1], b[y][0]);
				pos[i] = {x, x};
				break;
			}
		}
		
		ans[a[x][0]] = ans[a[x][1]] = i;
	}
	
	answer(ans);
	return 0;
}