// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  int n; cin >> n;
  if(n == 1){
    cout << "? 1" << endl;
    string s; cin >> s;
    cout << "! " << s[0] << (s[0] == 'R' ? 'B': 'R') << endl;
    return 0;
  }
  vector<int> q(n); rep(i, n)q[i] = i + 1;
  string b = "Red";
  cout << "? " << q << endl;
  cin >> b;
  string s;
  string res = ""; rep(i, 2 * n)res += "n";
  int k = n;

  int ld = 0, rd = n;
  int r = 1;
  if(b == "Red")r = 1;
  else r = 0;
  int cnt = 1;

  while(rd - ld > 1){
    int md = (rd + ld) / 2;
    rep(i, n)q[i] = md + i + 1;
    cnt++;
    assert(cnt <= 210);
    cout << "? " << q << endl;
    string u; cin >> u;
    if(u == b)ld = md;
    else rd = md;
  }

  k = ld + 1;

  res[k-1] = (r == 1 ? 'R': 'B');
  res[k+n-1] = (r == 1 ? 'B': 'R');
  rep(i, n - 1)q[i] = k + 1 + i;
  for(int i = 0; i < 2 * n; i++){
    if(k - 1 <= i && i <= k + n - 1)continue;
    q.back() = i + 1;
    cnt++;
    assert(cnt <= 210);
    cout << "? " << q << endl;
    cin >> s;
    res[i] = s[0];
  }
  q.resize(0);
  rep(i, 2 * n){
    if(k - 1 <= i && i <= k + n - 1)continue;
    q.pb(i + 1);
  }
  q.pb(0);
  for(int i = k; i < k + n - 1; i++){
    q.back() = i + 1;
    cnt++;
    assert(cnt <= 210);
    cout << "? " << q << endl;
    cin >> s;
    res[i] = s[0];
  }
  cout << "! " << res << endl;
  return 0;
}


Measured memory_bytes: 724