#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}


int main(void){
  ll n;cin>>n;

  vector<string> ans;
  ans.push_back("hoge");
  rep(i,2*n){
    ans.push_back("");
  }

  cout<<"?"<<" ";
  reps(i,n){
    cout<<i<<" ";
  }
  cout<<endl;
  string base;
  cin>>base; //赤
  string not_base;
  if(base == "Red"){
    not_base = "Blue";
  }else{
    not_base = "Red";
  }
  int key = -1;
  int ok = 0, ng = n;
  while(ng - ok > 1){
    int k = (ok + ng) / 2;
    cout<<"? ";
    reps(i,n){
      if(i<=k) cout<<n+i<<" ";
      else cout<<i<<" ";
    }
    cout<<endl;

    string T;
    cin>>T;
    if(T == "-1"){
      while(true){

      }
    }
    if(T != base){
      ng = k;
    }else{
      ok = k;
    }
  }
  key = ng;
  ans[key] = base;
  ans[key+n] = not_base;

  vector<int> kijun;
  reps(i,n){
    if(i<key) kijun.push_back(i+n);
    else if(i>key) kijun.push_back(i);
  }

  reps(i, n){
    if(i==key) continue;
    cout<<"? ";
    rep(j,n-1){
      cout<<kijun[j]<<" ";
    }
    int target;
    if(i<key) target=i;
    else if(i>key) target=i+n;
    cout<<target<<endl;

    string T;
    cin>>T;
    if(T == "-1"){
      while(true){
        
      }
    }
    ans[target] = T;
  }

  reps(i, n){
    if(i==key) continue;
    cout<<"? ";
    rep(j,n-1){
      cout<<(n+kijun[j]-1)%(2*n)+1<<" ";
      //後で確認
    }
    int target;
    if(i<key) target=i+n;
    else if(i>key) target=i;
    cout<<target<<endl;

    string T;
    cin>>T;
    if(T == "-1"){
      while(true){
        
      }
    }
    ans[target] = T;
  }

  cout<<"! ";
  reps(i,2*n){
    if(ans[i] == "Red") cout<<"R";
    else cout<<"B";
  }
  cout<<endl;
  return 0;
}


Measured memory_bytes: 724