#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 50505

int N;
int _ans[sz];

int rnd(int l,int r){return 1ull*rand()*rand()%(r-l+1)+l;}
void init() {
    N=rnd(1,50000);
    rep(i,1,N) _ans[i]=i;
    rep(i,1,N) swap(_ans[i],_ans[rnd(i,min(N,i+2))]);
}

vector<int>p,_;
map<set<vector<int>>,int>ti;
map<set<vector<int>>,pii>op;
map<set<vector<int>>,array<set<vector<int>>,2>>to;
int dfs(set<vector<int>>S, int n, int flg=0) {
    if (ti.count(S)) return ti[S];
    if (S.size()<=1u) return ti[S]=0;
    int &res=ti[S]=1e9;
    rep(i,0,n-1) rep(j,i+1,n-1) if (!flg||(i==n-2&&j==n-1)) {
        set<vector<int>>ss[2];
        for (auto p:S) ss[p[i]<p[j]].insert(p);
        if (chkmin(res,max(dfs(ss[0],n),dfs(ss[1],n))+1)) op[S]={i,j},to[S]={ss[0],ss[1]};
    }
    return res;
}

map<pii,int>cmp;
int tititi;
int query(int x,int y) {
    if (cmp.count({x,y})) return cmp[{x,y}];
    ++tititi;
    int w;
    #ifdef zqj
    assert(1<=x&&x<=N&&1<=y&&y<=N&&x!=y);
    w=(_ans[x]<_ans[y]);
    #else
    printf("? %d %d\n",x,y);
    fflush(stdout);
    char c; cin>>c; w=(c=='<');
    #endif
    cmp[{x,y}]=w;
    cmp[{y,x}]=w^1;
    return w;
}

int n;
void out(int *ans) {
    #ifdef zqj
    cerr<<tititi<<'\n'<<5*N/3+5<<'\n';
    assert(tititi<=5*N/3+5);
    rep(i,1,N) assert(ans[i]==_ans[i]);
    cerr<<"ok\n";
    #else
    cout<<"! ";
    rep(i,1,n) cout<<ans[i]<<" \n"[i==n];
    fflush(stdout);
    #endif
    exit(0);
}

int main() {
    unsigned long long seed=(size_t)(new char);
    // unsigned long long seed=2482949040928ull;
    cerr<<seed<<'\n';
    srand(seed);
    rep(i,0,4) p.push_back(i);
    _=p;
    set<vector<int>>S[6];
    rep(x,0,1) rep(i,0,2) rep(j,0,2) rep(k,0,2) rep(l,0,1) {
        p=_;
        swap(p[0],p[x]);
        swap(p[0],p[0+i]);
        swap(p[1],p[1+j]);
        swap(p[2],p[2+k]);
        swap(p[3],p[3+l]);
        S[5].insert(p);
    }
    _.resize(4);
    rep(x,0,1) rep(i,0,2) rep(j,0,2) rep(k,0,1) {
        p=_;
        swap(p[0],p[x]);
        swap(p[0],p[0+i]);
        swap(p[1],p[1+j]);
        swap(p[2],p[2+k]);
        S[4].insert(p);
    }
    _.resize(3);
    rep(x,0,1) rep(i,0,2) rep(j,0,1) {
        p=_;
        swap(p[0],p[x]);
        swap(p[0],p[0+i]);
        swap(p[1],p[1+j]);
        S[3].insert(p);
    }
    _.resize(2);
    rep(x,0,1) rep(i,0,1) {
        p=_;
        swap(p[0],p[x]);
        swap(p[0],p[0+i]);
        S[2].insert(p);
    }
    rep(n,2,5) dfs(S[n],n,1);
    // cout<<S.size()<<'\n';
    // cout<<dfs(S,1)<<'\n';
    #ifdef zqj
    init();
    n=N;
    #else
    cin>>n;
    #endif
    if (n==1) {
        static int ans[sz];
        ans[1]=1;
        out(ans);
        return 0;
    }
    vector<int>V;
    rep(i,1,n) V.push_back(i);
    static int ans[sz];
    while (233) {
        int nn=min(5,(int)V.size());
        int nnn=V.size();
        auto cur=S[nn];
        int _tititi=tititi;
        // if (nnn!=n) assert(cmp.count({V[nnn-2],V[nnn-1]}));
        // if (nnn==12800)
        //     puts("");
        while (cur.size()>1u) {
            auto [x,y]=op[cur];
            int w=query(V[nnn-nn+x],V[nnn-nn+y]);
            cur=to[cur][w];
        }
        assert(tititi-_tititi<=5||(int)V.size()==n);
        auto p=*(cur.begin());
        rep(i,0,nn-1) ans[V[nnn-nn+i]]=nnn-nn+p[i]+1;
        rep(i,0,nn-1) rep(j,0,nn-1) if (i!=j) cmp[{V[nnn-nn+i],V[nnn-nn+j]}]=(p[i]<p[j]);
        vector<int>pp;
        rep(i,0,nn-1) if (p[i]<2) pp.push_back(V[nnn-nn+i]);
        rep(i,0,nn-1) V.pop_back();
        if (!V.size()) break;
        for (auto x:pp) V.push_back(x);
    }
    out(ans);
    return 0;
}