#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 1e18;
const ll fact_table = 5000000;
double Pi = 3.1415926535897932384626;
 
vector<ll> G[550010];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<"\n";
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 
 
ll mod = 998244353;
//ll mod = 1000000007;
 
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l;
ll k,ans;
ll x[500005],y[500005],z[500005];
char s[5005];
bool insame[500005];

bool renzoku(ll idx){
    pe("?");
    for(int i=idx;i<idx + n;i++){
        if(i + 1 >= 2 * n + 1){
            pe(i + 1 - 2 * n);
        }else{
            pe(i + 1);
        }
    }
    el;
    cin >> s;
    if(strlen(s) == 3){
        return true;
    }else if(strlen(s) == 4){
        return false;
    }else{
        assert(1 == 0);
    }
    return false;
}

bool same_query(ll same_left, ll idx){
    pe("?");
    for(int i=0;i<2 * n;i++){
        if(insame[i])pe(i + 1);
    }
    p(idx + 1);
    cin >> s;
    if(strlen(s) == 3){
        return true;
    }else if(strlen(s) == 4){
        return false;
    }else{
        assert(1 == 0);
        return false;
    }
}

bool last_query(ll idx){
    pe("?");
    for(int i=0;i<n-1;i++){
        pe(y[i] + 1);
    }
    p(idx + 1);
    cin >> s;
    if(strlen(s) == 3){
        return true;
    }else if(strlen(s) == 4){
        return false;
    }else{
        assert(1 == 0);
    }
    return false;
}

void answer(){
    pe("!");
    for(int i=0;i<2 * n;i++){
        if(x[i] == 1){
            pu("B");
        }else if(x[i] == 2){
            pu("R");
        }else{
            assert(1 == 0);
            pu("?");
        }
    }
    el;
    return;
}

int main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    
    cin >> n;
    bool resbefore = renzoku(0);
    ll same_left = -1;
    ll before = 0, after = n;
    while(after - before > 1){
        ll mid = (after + before) / 2;
        bool res = renzoku(mid);
        if(res == resbefore){
            before = mid;
        }else{
            after = mid;
        }
    }
    //before / after
    if(resbefore){
        x[before] = 2;
        x[before+n] = 1;
        same_left = before + 1;
    }else{
        x[before] = 1;
        x[before+n] = 2;
        same_left = before + 1;
    }
    for(int i=same_left;i<=same_left + n - 2;i++){
        if(i >= 2 * n){
            insame[i - 2 * n] = true;
        }else{
            insame[i] = true;
        }
    }
    for(int i=0;i<2 * n;i++){
        if(insame[i])continue;
        if(x[i] != 0)continue;
        bool res = same_query(same_left, i);
        if(res){
            x[i] = 2;
        }else{
            x[i] = 1;
        }
    }
    vector<ll> red, blue;
    ll idx = 0;
    for(int i=0;i<2 * n;i++){
        if(x[i] == 1){
            blue.pb(i);
        }else if(x[i] == 2){
            red.pb(i);
        }
        if(blue.size() >= n / 2 && red.size() >= n / 2){
            for(int j=0;j<n/2;j++){
                y[idx++] = blue.back();
                blue.pop_back();
            }
            for(int j=0;j<n/2;j++){
                y[idx++] = red.back();
                red.pop_back();
            }
            break;
        }

    }
    for(int i=0;i<2*n;i++){
        if(insame[i]){
            bool res = last_query(i);
            if(res){
                x[i] = 2;
            }else{
                x[i] = 1;
            }
        }
    }
    answer();


    return 0;
}


















Measured memory_bytes: 19668