#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

struct dice {
  mt19937 mt;
  dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
  // [0, x)の一様乱数
  ll operator()(ll x) { return this->operator()(0, x); }
  // [x, y)の一様乱数
  ll operator()(ll x, ll y) {
    uniform_int_distribution<ll> dist(x, y - 1);
    return dist(mt);
  }
  vl operator()(int n, ll x, ll y) {
    vl res(n);
    for (int i = 0; i < n; i++) res[i] = this->operator()(x, y);
    return res;
  }
} rnd;

int n;

string ask(vi a) {
  cout << "?";
  rep (i, n) {
    cout << " " << a[i] + 1;
  }
  cout << endl << flush;
  string res;
  cin >> res;
  if (res == "-1") assert(false);
  return res;
}

signed main() {
  cin >> n;

  vi a(n);
  rep (i, n) a[i] = i;
  string initial_color = ask(a);

  string ans(2 * n, '?');
  int sakai;

  int ok = 0, ng = n;
  string ng_color = initial_color;
  string ok_color = (initial_color == "Red") ? "Blue" : "Red";
  while (ok + 1 < ng) {
    //DEBUG(pii(ok, ng));
    int mid = (ok + ng) / 2;
    a.clear();
    rep (i, mid) a.push_back(i);
    for (int i = mid; i < n; i++) a.push_back(i + n);
    string color = ask(a);
    if (color == ok_color) {
      ok = mid;
    }
    else ng = mid;
  }
  /*
  DEBUG(ok);
  DEBUG(ng);
  DEBUG(ok_color);
  DEBUG(ng_color);
  //*/
  ans[ok] = ng_color[0];
  ans[ok + n] = ok_color[0];
  sakai = ok;

  //DEBUG(ans);
  // rrep (i, n) {
  //   a[i] = n + i;
  //   string color = ask(a);
  //   if (initial_color != color) {
  //     ans[i] = initial_color[0];
  //     ans[n + i] = color[0];
  //     sakai = i;
  //     break;
  //   }
  // }

  set<int> used;
  vi b;
  //DEBUG(sakai);
  rep (i, n) {
    if (i == sakai) continue;
    b.push_back(a[i]);
    used.insert(a[i]);
  }
  //DEBUG_VEC(b);

  vi c;
  int r_cnt = 0, b_cnt = 0;
  rep (i, 2 * n) {
    if (ans[i] != '?') continue;
    if (used.count(i)) {
      continue;
    }
    c.push_back(i);
    b.push_back(i);
    string color = ask(b);
    ans[i] = color[0];
    if (ans[i] == 'R') r_cnt++;
    else b_cnt++;
    b.pop_back();
  }
  assert(r_cnt == b_cnt);
  //DEBUG_VEC(c);
  //DEBUG(ans);

  assert(c.size() == n - 1);
  rep (i, 2 * n) {
    if (ans[i] != '?') continue;
    c.push_back(i);
    string color = ask(c);
    ans[i] = color[0];
    c.pop_back();
  }

  cout << "! ";
  cout << ans << endl << flush;
}


Measured memory_bytes: 724