#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define Yes "Yes"
#define No "No"
#define DEFAULT LL ans=solve();\
 	if(ans==NONE){\
 	}else{\
 		cout << ans << endl;\
 	}
#define YESNO three(solve(),OUT(YES),OUT(NO))
#define YesNo three(solve(),OUT(Yes),OUT(No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(b-1);i>=(LL)(a);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,zero,b)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template<typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template<typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<pr, Vpr > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
const int SIZE1 = 5e5 + 1000;
const int SIZE2 = 5010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
const LL NONE=-2;
typedef pair<ld, ut> pld;
ut N, M, K, Q, D, H, W,R;
VI edges[SIZE];
LL vals[SIZE], answer = zero;
LL A[SIZE]={0,3,2,1},B[SIZE]={0,3,2,1};
LL sum[SIZE];
int color[SIZE];
LL SAME=1,DIFF=2;
string query(int x){
	string s;
	cout << "?";
	REP(i,N){
		cout << " " << (x+i)%(2*N)+1;
	}
	cout << endl;
	cin >> s;
	return s;
}
string query(int x,int tar){
	string s;
	cout << "?";
	REP(i,N-1){
		cout << " " << (x+i)%(2*N)+1;
	}
	cout <<" " << (x+tar)%(2*N)+1;
	cout << endl;
	cin >> s;
	return s;
}
LL solve(){
	cin>>N;
	string st=query(0);
	LL ok=N+0,ng=0;
	while(ok-ng>1){
		int mid=(ok+ng)/2;
		if(query(mid)==st){
			ng=mid;
		}else{
			ok=mid;
		}
	}
//	color[ok+N]=SAME;
	REP(i,N){
		LL sst=ok,tar=N+i;
		if(query(sst,tar)==st){
			color[(sst+tar)%(2*N)]=SAME;
		}else{
			color[(sst+tar)%(2*N)]=DIFF;	
		}
	}
	REP(i,N){
		LL sst=ok+N,tar=N+i;
		if(query(sst,tar)==st){
			color[(sst+tar)%(2*N)]=SAME;
		}else{
			color[(sst+tar)%(2*N)]=DIFF;	
		}
	}
	cout << "! ";
	REP(i,2*N){
		if(color[i]==SAME) cout << st[0];
		else cout << three(st[0]=='R','B','R');
	}
	cout <<endl;
	return NONE;
}
 signed main() {
 
	//ios_base::sync_with_stdio(false);
	//cout << fixed << setprecision(10);
	string s;
	LL T;
	DEFAULT;
	
//	YesNo;
//	YESNO;
//	three(solve(),OUT("First"),OUT("Second"));
	//cin >> N;
	return 0;
 
}

Measured memory_bytes: 13652