#include <bits/stdc++.h>

#define forn(i, n) for(int i = 0; i < (int)n; ++i)
#define for1(i, n) for(int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for(int i = (int)l; i <= (int)r; ++i)
#define fored(i, l, r) for(int i = (int)r; i >= (int)l; --i)
#define all(x) x.begin(), x.end()
#define el '\n'
#define d(x) cerr << #x << ' ' << x << el

#define sz(a) (int) a.size()
#define pb push_back
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 4> a4;
typedef pair<int,int> ii;
typedef tuple<ll,int,int> iii;
const int nax = 2e5;
// const int nax = 2e3;

const ll inf = 1e17;
void show(vi &v){
    for(int x : v)cout<<x<<" ";
    cout<<el;
}
map<ii, int> queries;
bool find(int i, int j){
    if(i==j)return 0;
    assert(i< j);
    if(queries.find({i,j}) != queries.end()){
        return queries[{i,j}];
    }
    cout<<"? "<<i<<" "<<j<<endl;
    bool parity;
    cin>>parity;
    queries[{i,j}] = parity;
    return parity;
}

bool isGreater(int i, int j){
    if(abs(j-i) == 1) return find(i,j);
    assert(i < j);
    int allRange = find(i, j);
    int excL = find(i+1, j), excR = find(i, j-1);
    int excAll = find(i+1, j-1);
    if(((excL + excR - excAll + 2) % 2) != allRange) return 1;
    return 0;

}
void solve(){
    int n;
    cin>>n;
    if(n == 1){
        cout<<"! 1"<<endl;
        return ;
    }
    vi v(n);
    iota(all(v), 1);
    if(isGreater(v[0],v[1])) swap(v[0], v[1]);

    fore(i,2,n-1){
        int lo = -1, hi = i;
        while(lo + 1 < hi){
            int mid = lo + (hi-lo)/2;
            if(isGreater(v[mid], v[i])){
                hi = mid;
            }else lo = mid;
        }
        // d(hi);
        // show(v);
        fored(j, hi, i-1){
            swap(v[j], v[j+1]);
        }
        // show(v);
    }
    vi ans(n);
    forn(i,n){
        ans[v[i]-1] = i+1;
    }
    cout<<"! ";
    forn(i,n)cout<<ans[i]<<" ";
    cout<<endl;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tt = 1;
    // cin>>tt;
    while(tt--){
        solve();
    }
}

/**
 * aprendizaje: 
 * Fijar 2 elementos y pensar como ordenarlos. Pensar en reducir la cantidad de consultas
*/