#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) range(i,0,b)
#define rangei(i,a,b) for(ll a=a;i<=ll(b);i++)
#define repi(i,b) rangei(i,1,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator << (ostream &os, vector<T> const &);
template<int n, class...T>
typename enable_if<(n>=sizeof...(T))>::type
_ot(ostream &, tuple<T...> const &){}
template<int n, class...T>
typename enable_if<(n< sizeof...(T))>::type
_ot(ostream &os, tuple<T...> const &t){
    os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t);
}
template<class...T>
ostream & operator << (ostream &os, tuple<T...> const &t){
    _ot<0>(os, t); return os;
}
template<class T, class U>
ostream & operator<<(ostream &os, pair<T,U> const &p){
    return os << "(" << p.first << ", " << p.second << ") ";
}
template<class T>
ostream & operator<<(ostream &os, vector<T> const &v){
    rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os;
}
#ifdef DEBUG
#define dump(...) (cerr << #__VA_ARGS__ << " = " << mt(__VA_ARGS__) \
                   << " [" << __LINE__ << "]" << endl)
#else
#define dump(...)
#endif
void fastios(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // #define endl '\n'
}
template<class T>
size_t uniq(vector<T> &v){
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v.size();
}
template<class T>
size_t uniq(T *l, size_t n){
    sort(l,l+n);
    return unique(l,l+n) - l;
}
#define mems(arr,val) memset(arr,val,sizeof(arr));
int const mod = 1000000007;
int const inf = numeric_limits<int>::max()/8;

int n;

vector<char> ask(vector<pair<int,int>> q){
    int rem = n;
    assert((int)q.size() <= n);
    cout << "?";
    for(auto & p : q){
        rem--;
        cout << " " << p.first << " " << p.second;
    }
    while(rem){
        cout << " 0 0";
        rem--;
    }
    cout << endl;
    vector<char> res(n);
    rep(i,n) cin >> res[i];
    return res;
}

int main(){
    srand(time(0));
    cin >> n;
    vector<int> a(n);
    rep(i,n) a[i] = i+1;
    random_shuffle(a.begin(), a.end());
    vector<pii> q;
    vector<char> r;

    while(1){
        bool finish = true;
        q.clear();
        for(int i=0; i*2+1 < n; i++){
            q.eb(a[i*2], a[i*2+1]);
        }
        r = ask(q);
        for(int i=0; i*2+1 < n; i++){
            if(r[i] == '>'){
                swap(a[i*2], a[i*2+1]);
                finish = false;
            }
        }

        q.clear();
        for(int i=0; i*2+2 < n; i++){
            q.eb(a[i*2+1], a[i*2+2]);
        }
        r = ask(q);
        for(int i=0; i*2+2 < n; i++){
            if(r[i] == '>'){
                swap(a[i*2+1], a[i*2+2]);
                finish = false;
            }
        }
        if(finish) break;
    }
    cout << "! ";
    cout << a << endl;
}