#include <bits/stdc++.h>
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
using namespace std;

// tr << ( vector, map, pair, tuple, etc... ) << endl//{{{
template <typename T, typename U>
struct sfinae_helper{typedef void type;};
template <typename T, typename U = void>
struct Print{ static ostream &pp(ostream &os, const T &x){ return os << x; } };
struct trace{//{{{
    ostream& os;
    trace(ostream& os): os(os) { }
    template<typename T>
        trace& operator<<(const T& x){ Print<T>::pp(os, x); return *this;}
    trace &operator<<(ostream& f(ostream&)){ f(os); return *this; }
    operator ostream &(){ return os; }
} tr(cout);//}}}
// string//{{{
template <> struct Print<string, void>{ static ostream &pp(ostream &os, const string &x){ return os << x; } };
//}}}
// Container//{{{
template <typename T> struct Print<T, typename sfinae_helper<T, typename T::iterator>::type>{
    static ostream &pp(ostream &os, const T &v){
        trace(os) << '[';
        for(const auto &x : v) trace(os) << x << ", ";
        return trace(os) << ']';
    }
};//}}}
// Pair//{{{
template <typename T> struct Print<T, typename sfinae_helper<T, typename T::first_type>::type>{
    static ostream &pp(ostream &os, const T &x){
        return trace(os) << '(' << x.first << ", " << x.second << ')';
    }
};//}}}
// Tuple//{{{
template<class T, size_t N> struct TuplePrint{
    static ostream &print(ostream &os, const T &x){
        TuplePrint<T, N-1>::print(os, x) << ", ";
        return trace(os) << get<N-1>(x);
        //return Print<decltype(get<N-1>(x))>::pp(os, get<N-1>(x));
    }
};
template<class T> struct TuplePrint<T, 1>{
    static ostream &print(ostream &os, const T &x){
        return trace(os) << get<0>(x);
    }
};
template <typename... Args>//Tuple
struct Print<tuple<Args...>>{
    static ostream &pp(ostream &os, const tuple<Args...> &x){
        os << "(";
        return TuplePrint<decltype(x), sizeof...(Args)>::print(os, x) << ")";
    }
};//}}}
//}}}
constexpr int N = 1000000;
vector<int> query(const int &n, vector<int> ord){//{{{
    if(rand() % 2) reverse(begin(ord), end(ord));
    if(rand() % 2){ ord.pop_back(); reverse(begin(ord), end(ord)); }
    if(ord.size() % 2) ord.pop_back();
    // rep(i, ord.size()/2) if(ord[i*2] < ord[i*2+1]) swap(ord[i*2], ord[i*2+1]);
    // return ord;
    cout << '?';
    rep(i, ord.size()) cout << ' ' << ord[i]+1;
    rep(_, 2 * n - ord.size()) cout << ' ' << 0;
    cout << endl; cout.flush();
    char ch;
    rep(i, ord.size()/2){
        cin >> ch;
        if(ch == '>') swap(ord[i*2], ord[i*2+1]);
    }
    rep(_, n - ord.size()/2) cin >> ch;
    return ord;
}//}}}

bool solve(){
    int n; cin >> n;
    vector<set<int>> g(n);
    rep(cnt, 2000){
        vector<int> deg(n), q;
        rep(u, n) for(auto &v : g[u]) ++deg[v];
        rep(u, n) if(!deg[u]) q.emplace_back(u);
        vector<int> ord;
        bool ok = true;
        while(!q.empty()){
            ok &= q.size() == 1;
            int idx = rand() % q.size();
            swap(q[idx], q.back());
            int u = q.back(); q.pop_back();
            ord.emplace_back(u);
            for(auto &v : g[u]) if(!--deg[v]) q.emplace_back(v);
        }
        if(ok){
            cerr << cnt << endl;
            cout << '!';
            rep(i, n) cout << ' ' << ord[i]+1;
            cout << endl;
            break;
        }
        auto res = query(n, ord);
        rep(i, res.size()/2) g[res[i*2]].emplace(res[i*2+1]);
    }
    return true;
}

signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);
    solve();
    return 0;
}
// vim:set foldmethod=marker commentstring=//%s: