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

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq=priority_queue<T>;
template<class T> using pqg=priority_queue<T,vector<T>,greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a,const T& b) { return b<a?a=b,1:0; }
template<class T> bool ckmax(T& a,const T& b) { return a<b?a=b,1:0; }

const int MOD=1000000007;
const char nl='\n';
const int MX=100001;

int query(int L,int R)
{
    cout<<"? "<<L+1<<" "<<R+1<<endl;
    int ans; cin>>ans; return ans;
}

void solve()
{
    int N; cin>>N;
    vector<int>pos(N);
    pos[0]=0;
    FOR(i,1,N)
    {
        int lo=0,hi=i;
        while(lo<hi)
        {
            int mid=(lo+hi)/2;
            int cnt=0; F0R(j,mid) if(pos[j]>pos[mid]) cnt++;
            if(query(pos[mid],i)!=(query(pos[mid]+1,i)+cnt)%2)
            {
                hi=mid;
            }
            else
            {
                lo=mid+1;
            }
        }
        FORd(j,lo+1,i+1)
        {
            pos[j]=pos[j-1];
        }
        pos[lo]=i;
    }
    vector<int>ans(N);
    F0R(i,N) ans[pos[i]]=i+1;
    cout<<"! ";
    F0R(i,N)
    {
        cout<<ans[i]<<" ";
    }
    cout<<endl;

}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int T=1;
    //    cin >> T;
    while(T--)
    {
        solve();
    }

    return 0;
}