#include <cassert>
#include "limits.h"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
 
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cerr << "debug " <<"LINE:"<<__LINE__<<"  "<< #i <<":"<< i << std::endl

 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if ((a == 0)||(mod!=-1&&a%mod==0)) {
    return 0;
  }
 
  long long x = 1;
 
  while (b > 0) {
    if (b & 1) {
      x = (mod!=-1)?(x * a) % mod:x*a;
    }
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}
 
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

using ll = long long;
using P = std::pair<ll, ll>;



int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin>>n;

  std::vector<ll> color(n+1,-1);

  std::vector<char> ans(2*n);

  std::cout<<"? ";
  rep(i,1,n+1)std::cout<<i<<" ";
  std::cout<<std::endl;

  std::string s;
  std::cin>>s;
  if(s=="Red")color[0]=0;
  else color[0]=1;

  color[n]=color[0]^1;

  ll left=0,right=n+1;
  ll first,second;
  while(1){
    ll mid=left+(right-left)/2;

    if(color[mid]==-1){
      std::cout<<"? ";
      rep(i,mid,mid+n)std::cout<<i+1<<" ";
      std::cout<<std::endl;

      std::cin>>s;
      if(s=="Red")color[mid]=0;
      else color[mid]=1;
    }
    if(color[mid-1]==-1){
      std::cout<<"? ";
      rep(i,mid-1,mid-1+n)std::cout<<i+1<<" ";
      std::cout<<std::endl;

      std::cin>>s;
      if(s=="Red")color[mid-1]=0;
      else color[mid-1]=1;
    }

    if(color[mid-1]^color[mid]){
      first=mid-1;
      second=mid;
      ans[first]=(color[first])?'B':'R';
      ans[first+n]=(color[second])?'B':'R';
      break;
    }else{
      if(color[mid]==color[left])left=mid;
      else right=mid;
    }
  }

  rep(i,0,first){
    std::cout<<"? "<<i+1<<" ";
    rep(j,second,second+n-1)std::cout<<j+1<<" ";
    std::cout<<std::endl;

    std::cin>>s;
    ans[i]=s[0];
  }

  rep(i,second+n,2*n){
    std::cout<<"? ";
    rep(j,second,second+n-1)std::cout<<j+1<<" ";
    std::cout<<i+1<<" ";
    std::cout<<std::endl;

    std::cin>>s;
    ans[i]=s[0];
  }

  rep(i,second,first+n){
    std::cout<<"? ";
    rep(j,0,first)std::cout<<j+1<<" ";
    std::cout<<i+1<<" ";
    rep(j,second+n,2*n)std::cout<<j+1<<" ";
    std::cout<<std::endl;

    std::cin>>s;
    ans[i]=s[0];
  }

  std::cout<<"! ";
  rep(i,0,2*n)std::cout<<ans[i];
  std::cout<<std::endl;

  return 0;
}

Measured memory_bytes: 724