#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int z[11],p[(1<<11)+5];
int query(int i,int j)
{
    printf("? %d %d\n",i,j);
    fflush(stdout);
    int ans;
    scanf("%d",&ans);
    assert(ans!=-1);
    return ans;
}
int get(int i,int sup)
{
    int ans=sup;
    for (int b=0;b<11;b++)
    {
        if (ans&(1<<b))
        {
            if (z[b]!=i)
            ans&=query(i,z[b]);
            else
            ans^=(1<<b);
        }
    }
    return ans;
}
int main()
{
    int n;
    scanf("%d",&n);
    memset(z,-1,sizeof(z));
    while (count(z,z+11,-1))
    {
        int i=uniform_int_distribution<int>(1,n)(rng),j=uniform_int_distribution<int>(1,n)(rng);
        if (i==j)
        continue;
        int tmp=query(i,j);
        for (int b=0;b<11;b++)
        {
            if (!(tmp&(1<<b)))
            z[b]=i;
        }
    }
    vector<int> qp;
    for (int i=1;i<=n;i++)
    qp.push_back(i);
    shuffle(qp.begin(),qp.end(),rng);
    int idx=-1,val=(1<<11)-1;
    for (i:qp)
    {
        if (idx==-1 || query(idx,i)==val)
        {
            idx=i;
            val=get(i,val);
        }
    }
    for (int i=1;i<=n;i++)
    {
        if (i!=idx)
        p[i]=query(i,idx);
    }
    printf("!");
    for (int i=1;i<=n;i++)
    printf(" %d",p[i]);
    printf("\n");
    fflush(stdout);
}