#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const ll INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};

//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; 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 comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

//1が青, -1が赤
ll N;
ll question(ll s){
  cout << "? ";
  rep(i, N){
    cout << (s + i) % (2 * N) + 1 << " ";
  }
  cout << endl;
  string S;
  cin >> S;
  if(S == "Red") return -1;
  return 1;
}

ll ques(vector<ll> X, ll s){
  cout << "? ";
  rep(i, X.size()){
    cout << X[i] + 1 << " ";
  }
  cout << s + 1 << endl;
  string S;
  cin >> S;
  if(S == "Red") return -1;
  return 1;
}

void solve(){
  cin >> N;
  ll ok = 0, ng = N;
  vector<ll> conq(N+1, 0);
  while(ng - ok > 1){
    ll mid = (ok + ng) / 2;
    if(conq[ok] == 0){
      conq[ok] = question(ok);
    }
    if(conq[ng] == 0){
      conq[ng] = question(ng);
    }
    if(conq[mid] == 0){
      conq[mid] = question(mid);
    }
    if(conq[ok] == conq[mid]){
      ok = mid;
    }else{
      ng = mid;
    }
  }
  vector<ll> ans(2 * N, 0);
  ans[ok] = conq[ok];
  ans[ok+N] = conq[ng];
  vector<ll> same;
  for(ll i = ok + 1; i < ok + N; i++){
    same.pb(i);
  }
  rep(i, N){
    ll s = (ok + N + i) % (2 * N);
    if(ans[s] != 0) continue;
    ans[s] = ques(same, s);
  }
  vector<ll> blue, red;
  rep(i, 2 * N){
    if(ans[i] == 0) continue;
    if(ans[i] == 1) blue.pb(i);
    else red.pb(i);
  }
  same.resize(0);
  rep(i, N/2){
    same.pb(red[i]);
    same.pb(blue[i]);
  }
  rep(i, 2 * N){
    if(ans[i] != 0) continue;
    ans[i] = ques(same, i);
  }
  cout << "! ";
  rep(i, 2 * N){
    if(ans[i] == 1) cout << "B";
    else cout << "R";
  }
  cout << endl;

}


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 724