#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
    if(a < b)swap(a,b);
    if(a % b == 0)return b;
    else return gcd(b,a%b);
}
//素数判定O(sqrt(N))
bool isp(ll n){
    bool res = true;
    if(n == 1)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}

ll fac[510000], finv[510000], inv[510000];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < 510000; i++){
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod%i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

// 二項係数計算
ll COM(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
//nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n,ll m,ll MOD){
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}

//printf("%.10f\n", N);
/*  vector<ll> vec = {1,2,5,6,8,9,10};
    cout << binary_search(all(vec),5) << endl; -> true*/
/*
    vector<ll> vec = {1,2,5,6,8,9,10};
    auto n = upper_bound(all(vec),4);
    cout << *n << endl; -> 5*/
/*
    cout << fixed << setprecision(15);
*/
int main(){
    ll N;
    cin >> N;
    string res;
    if(N == 1){
        cout << "? 1" << "\n";
        fflush(stdout);
        cin >> res;
        if(res == "Red")cout << "! RB" << "\n";
        else if(res == "Blue")cout << "! BR" << "\n";
        return 0;
    }
    vector<ll> kyou(N - 1);
    ll l = 1,r = N + 1;
    vector<char> ans(N * 2);
    vector<char> color(N + 1);
    cout << "? ";
    rep(i,N){
        if(i != N - 1)cout << i + 1 << " ";
        else cout << i + 1 << "\n";
    }
    fflush(stdout);
    cin >> res;
    if(res == "Red"){
        color[0] = 'R';
        color[N] = 'B';
    }
    else if(res == "Blue"){
        color[0] = 'B';
        color[N] = 'R';
    }
    else return 0;
    ll mid;
    while(r - l > 1){
        mid = (l + r) / 2;
        cout << "? ";
        rep(i,N){
            if(i != N - 1)cout << mid + i << " ";
            else cout << mid + N - 1 << "\n";
        }
        fflush(stdout);
        cin >> res;
        if(res == "Red"){
            color[mid - 1] = 'R';
        }
        else if(res == "Blue") color[mid - 1] = 'B';
        else return 0;
        if(color[mid - 1] == color[l - 1]){
            l = mid;
        }
        else{
            r = mid;
        }
    }
    rep(i,N - 1){
        kyou[i] = r + i;
    }
    //rep(i,color.size())cout << color[i] << ",";
    //cout << l << "," << r << "\n";
    if(color[l - 1] == 'R'){
        ans[l - 1] = 'R';
        ans[kyou[N - 2]] = 'B';
    }
    else{
        ans[l - 1] = 'B';
        ans[kyou[N - 2]] = 'R';
    }
    //rep(i,N * 2)cout << ans[i] << ",";
    vector<ll> igai;
    for(ll i = 1;i <= 2 * N;i++){
        if(i != kyou[0] - 1)igai.push_back(i);
        else i += N;
    }
    /*rep(i,N - 1){
        cout << kyou[i] << " ";
    }
    cout << endl;
    rep(i,N - 1){
        cout << igai[i] << " ";
    }*/
    for(ll i =1;i <= 2 * N;i++){
        if(i != kyou[0] - 1 && i != kyou[N - 2] + 1){
            if(i <= kyou[N - 2] && i >= kyou[0]){
                cout << "? ";
                rep(i,N - 1){
                    cout << igai[i] << " ";
                }
                cout << i << "\n";
            }
            else{
                cout << "? ";
                rep(i,N - 1){
                    cout << kyou[i] << " ";
                }
                cout << i << "\n";
            }
            fflush(stdout);
            cin >> res;
            if(res == "Red")ans[i - 1] = 'R';else if(res == "Blue") ans[i - 1] = 'B';
            else return 0;
        }
    }
    cout << "! ";
    rep(i,N * 2){
        cout << ans[i];
    }
    cout << endl;
    return 0;
    /*rep(i,N - 1){
        cout << kyou[i] << ",";
    }
    cout << endl;
    rep(i,N - 1){
        cout << igai[i] << ",";
    }*/
}


Measured memory_bytes: 3848