#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

ll n;
int q(vll v){
  assert(SZ(v) == n);
  cout << "?";
  rep(i, n){
    v[i]++;
    cout << " " << v[i];
  }
  cout << endl;
  //dump(v);
  string ret;
  cin >> ret;
  if(ret == "-1") exit(0);
  return ret == "Red" ? 0 : 1;
}

vll qv;
vll ans;

// blue = 1

int main() {
  cin >> n;
  qv.resize(n);
  ans.resize(2*n, -1);
  iota(ALL(qv), 0);
  int first_q = q(qv);
  auto cond = [&](ll mid) -> bool{
    iota(ALL(qv), mid);
    return q(qv) == first_q;
  };
  auto BS = [&](ll true_max, ll false_min){
    while(false_min - true_max > 1){
      ll mid = true_max + ((false_min - true_max) / 2);
      (cond(mid) ? true_max : false_min) = mid;
    }
    return true_max;
  };
  
  ll res = BS(0, n);
  dump(res);
  ans[res] = first_q;
  ans[res+n] = !first_q;
  rep(i, res){
    vll qe;
    qe.emplace_back(res);
    qe.emplace_back(res+n);
    rep(j, res) if(i != j) qe.emplace_back(j);
    repr(j, res+n+1, 2*n) if(i != j) qe.emplace_back(j);
    ans[i] = !q(qe);
  }
  repr(i, res+n+1, 2*n){
    vll qe;
    qe.emplace_back(res);
    qe.emplace_back(res+n);
    rep(j, res) if(i != j) qe.emplace_back(j);
    repr(j, res+n+1, 2*n) if(i != j) qe.emplace_back(j);
    ans[i] = !q(qe);
  }
  repr(i, res+1, res+n){
    vll qe;
    qe.emplace_back(res);
    qe.emplace_back(res+n);
    repr(j, res+1, res+n) if(i != j) qe.emplace_back(j);
    ans[i] = !q(qe);
  }
  cout << "! ";
  rep(i, 2*n){
    cout << (ans[i] == 1 ? "B" : "R");
  }
  cout << endl;
}


Measured memory_bytes: 724