#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;
using namespace __gnu_pbds;

template<typename T> using indexed_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<int, ull> piu;
typedef vector<vector<int>> matrix;

const ll INF = 1e18 + 123;
const ld EPS = 1e-9;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 5e5 + 13;
const int M = 1e6 + 123;
const double pi = acos(-1.0);
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

void out(deque<int> &d){
    cout << "? ";
    for (int x : d){
        cout << x << " ";
    }
    cout << endl;
}

char ans[N];

int main(){
    int n;
    cin >> n;
    string x, s;
    cout << "? ";
    for (int i = 1; i <= n; i++){
        cout << i << " ";
    }
    cout << endl;
    cin >> x;
    int l = 1, r = n+1;
    while (r - l > 1){
        int mid = l + r >> 1;
        cout << "? ";
        for (int i = 0; i < n; i++){
            cout << i+mid << " ";
        }
        cout << endl;
        cin >> s;
        if (x != s){
            r = mid;
        }
        else{
            l = mid;
        }
    }
    //cout << r << endl;
    deque<int> d;
    ans[r-1] = x[0];
    if (x[0] == 'R'){
        ans[r+n-1] = 'B';
    }
    else{
        ans[r+n-1] = 'R';
    }
    for (int i = -1; i < n; i++){
        d.pb(r+i);
    }
    for (int i = 1; i < n; i++){
        cout << "? ";
        for (int j = 0; j <= n; j++){
            if (i == j)continue;
            cout << d[j] << " ";
        }
        cout << endl;
        cin >> s;
        if (s[0] == 'R'){
            ans[d[i]] = 'B';
        }
        else{
            ans[d[i]] = 'R';
        }
    }
    deque<int> dd;
    int b = n/2;
    r = n/2;
    for (int x : d){
        if (ans[x] == 'B' && b){
            b--;
            dd.pb(x);
        }
        if (ans[x] == 'R' && r){
            r--;
            dd.pb(x);
        }
    }
    b = n;
    r = n;
    for (int i = 1; i <= n+n; i++){
        if (ans[i] == 'B' || ans[i] == 'R'){
            if (ans[i] == 'B') b--;
            else r--;
        }
    }
    for (int i = 1; i <= n+n; i++){
        if (ans[i] == 'B' || ans[i] == 'R'){
            continue;
        }
        if (!b){
            ans[i] = 'R';
            continue;
        }
        if (!r){
            ans[i] = 'B';
            continue;
        }
        cout << "? ";
        for (int x : dd){
            cout << x << " ";
        }
        cout << i << " ";
        cout << endl;
        cin >> s;
        ans[i] = s[0];
        if (ans[i] == 'B') b--;
        else r--;
    }
    cout << "! ";
    for (int i = 1; i <= n+n; i++){
        cout << ans[i];
    }
    return 0;
}


Measured memory_bytes: 724