#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = (int)(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = (int)(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << '\n'

constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-10;

constexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
constexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

template<typename T>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T& a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
T meguru_search(T ok, T ng, function<bool(T)> check){
    while(max(ok, ng) - min(ok, ng) > T(1)){
        T mid = (ok + ng) / T(2);
        if(check(mid)){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    return ok;
}

int main(){
    int n;
    cin >> n;

    string ans(n << 1, ' ');

    auto query1 = [&](int s){
        cout << '?';
        REP(i, s, s + n){
            cout << ' ' << i % (n << 1) + 1;
        }
        cout << endl;

        string t;
        cin >> t;

        return t[0];
    };

    char q0 = query1(0);

    int k = meguru_search<int>(n, 0, [&](int mid){ return query1(mid) != q0; });

    auto query2 = [&](int j){
        cout << "? " << j + 1;
        REP(i, k, k + n - 1){
            cout << ' ' << i % (n << 1) + 1;
        }
        cout << endl;

        string t;
        cin >> t;

        return t[0];
    };

    rep(i, n << 1){
        if(k <= i && i < k + n){
            continue;
        }
        ans[i] = query2(i);
    }

    vector<int> v;
    int cntr = 0, cntb = 0;
    rep(i, n << 1){
        if(ans[i] == 'R' && cntr < ((n - 1) >> 1)){
            v.emplace_back(i);
            ++cntr;
        }
        if(ans[i] == 'B' && cntb < ((n - 1) >> 1)){
            v.emplace_back(i);
            ++cntb;
        }
    }

    auto query3 = [&](int j){
        cout << "? " << j + 1;
        for(auto x : v){
            cout << ' ' << x + 1;
        }
        cout << endl;

        string t;
        cin >> t;

        return t[0];
    };

    rep(i, n << 1){
        if(ans[i] == ' '){
            ans[i] = query3(i);
        }
    }

    cout << "! " << ans << endl;

    return 0;
}

Measured memory_bytes: 724