#define STOPIT
#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_a_genius = 0; ngtkana_is_a_genius < int(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (int i = int(begin); (i) < int(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#ifndef STOPIT
#define debug(...)\
  do {\
    std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
    debug_impl(__VA_ARGS__);\
    std::cerr << std::noboolalpha;\
  } while (false)
#else
#define debug(...) 0;
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

#define AUTO 0

int n;
std::vector< int > input;

auto query(std::vector< int > const& a) -> int {
  assert((int)a.size() == n);
  std::cout << "?";
  for (int x : a) std::cout << " " << x + 1;
  std::cout << std::endl;
  #if AUTO
    int cnt = 0;
    for (int x : a) cnt += input.at(x);
    int ret = n-cnt < cnt;
    std::cout << "judge: " << (ret ? "B" : "R") << std::endl;
    return ret;
  #else
    std::string c; std::cin >> c;
    return c == "Blue";
  #endif
}

auto answer(std::vector< int > const& a) {
  assert((int)a.size() == 2*n);
  std::cout << "!" << " ";
  for (int x : a) {
    std::cout << (x ? "B" : "R");
  }
  std::cout << std::endl;
  #if AUTO
    assert(input == a);
  #endif
  exit(0);
}

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  #if AUTO
    n = 13;
    loop(n) input.emplace_back(0);
    loop(n) input.emplace_back(1);
    std::shuffle(all(input), mt);
  #else
    std::cin >> n;
  #endif
  std::vector< int > a(n);
  std::vector< int > b(n);
  rep(i,0,n) {
    a.at(i) = i;
    b.at(i) = 2*n-1-i;
  }
  debug(a,b);
  int start = query(b);
  debug(start);
  int lb = 0, ub = n;
  while (ub - lb > 1) {
    int mid = (ub+lb) / 2;
    std::vector< int > c(n);
    debug(mid, c);
    rep(i,0,n) {
      c.at(i) = (i < mid ? a : b).at(i);
    }
    int ret = query(c);
    debug(ret);
    (ret == start ? lb : ub) = mid;
  }
  debug(lb, ub);
  std::vector< int > c(n);
  std::vector< int > d(n);
  rep(i,0,n) {
    c.at(i) = (i < lb ? a : b).at(i);
    d.at(i) = (i < lb ? b : a).at(i);
  }
  c.at(lb) = -1, d.at(lb) = -1;
  debug(c,d);

  std::vector< int > ans(2*n,-1);
  ans.at(a.at(lb)) = !start;
  ans.at(b.at(lb)) = start;
  for (int x : c) {
    if (x==-1) continue;
    std::vector< int > e = d;
    e.at(lb) = x;
    debug(x,ans);
    ans.at(x) = query(e);
  }
  for (int x : d) {
    if (x==-1) continue;
    std::vector< int > e = c;
    e.at(lb) = x;
    ans.at(x) = query(e);
  }
  debug(ans);
  answer(ans);
  return 0;
}

Measured memory_bytes: 724