#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//#define int long long

vector<int> balls;

string debug_query(vector<int> a) {
    cout << "? ";
    for(auto& x: a) cout << x + 1 << " ";
    cout << endl;
    int cntr = 0, cntb = 0;
    for(auto& x: a) {
        if(balls[x] == 'R') cntr ++;
        else cntb ++;
    }
    if(cntr > cntb) return "Red";
    else return "Blue";
}

string query(vector<int> a) {
    //return debug_query(a);
    cout << "? ";
    for(auto& x: a) cout << x + 1 << " ";
    cout << endl;
    fflush(stdout);
    string res;
    cin >> res;
    if(res == "-1") exit(0);
    return res;
}

//'R' or 'B' で返したほうがよかったな、、
//0indexed と1indexedは統一して、、

void solve() {
	int n; cin >> n;
    balls = {'R', 'R', 'B', 'B', 'R', 'B'};
    int a = 0, b = n;
    vector<int> res1(n), res2(n);
    rep(i, n) {
        res1[i] = i;
        res2[i] = i + n;
    }
    string A = query(res1), B = query(res2);
    while(b - a > 1) {
        int mid = (a + b) / 2;
        vector<int> res(n);
        rep(i, n) {
            res[i] = i + mid;
        }
        string C = query(res);
        if(A == C) a = mid;
        if(B == C) b = mid;
    }
    vector<char> ans(2 * n);
    ans[a] = (A == "Red" ? 'R' : 'B');
    ans[a + n] = (A == "Red" ? 'B' : 'R');
    vector<int> res(n);
    rep(i, n - 1) {
        res[i] = i + a + 1;
    }
    rep(i, 2 * n) {
        if(i >= a && i <= a + n) continue;
        auto hoge = res;
        hoge[n - 1] = i;
        string X = query(hoge);
        if(X == "Red") {
            ans[i] = 'R';
        } else {
            ans[i] = 'B';
        }
    }
    int j = -1;
    rep(i, n - 1) {
        if(j == a - 1) j = a + n + 1;
        else ++j;
        res[i] = j;
    }
    for(int i = a + 1; i <= a + n - 1; ++i) {
        auto hoge = res;
        hoge[n - 1] = i;
        string X = query(hoge);
        if(X == "Red") {
            ans[i] = 'R';
        } else {
            ans[i] = 'B';
        }
    }
    cout << "! ";
    for(auto& x: ans) cout << x;
    cout << endl;
    fflush(stdout);
    exit(0);
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
    return 0;
}

Measured memory_bytes: 724