#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

template<typename T> vector<T> make_vector(size_t sz){
	return vector<T>(sz);
}

template<typename T,typename... Ts> 
auto make_vector(size_t sz, Ts... ts){
	return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}

template<typename T,typename U,typename... V> 
typename enable_if<is_same<T, U>::value!=0>::type 
fill_value(U &u, const V... v){
	u=U(v...);
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_value(U &u, const V... v){
	for(auto &e:u){
		fill_value<T>(e,v...);
	}
}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

const pid_t pid = getpid();
// Problem Specific Parameter:

int n;

// int cnt = 0;
// bool output(const vector<int> &ball){
// 	cnt++;
// 	int red = 0, blue = 0;
// 	rep(i, n) {
// 		if(ball[i] < n)
// 			red++;
// 		else
// 			blue++;
// 	}
// 	return (red > blue);
// }

bool output(const vector<int> &ball){
	cout << "?";
	rep(i, n) cout << " " << ball[i] + 1;
	cout << endl << flush;
	string ret;
	cin >> ret;
	assert(ret != "-1");
	return (ret == "Red");
}

int query(int pos){
	vector<int> ball(n);
	rep(i, n) ball[i] = pos + i;
	return output(ball);
}



int main(void){
	cin >> n;
	int low = 0, high = n;
	const bool init = query(0);

	while(high - low > 1){
		const int mid = (low + high) / 2;
		if(query(mid) == init)
			low = mid;
		else
			high = mid;
	}
	
	const int base_low = high;
	const int base_high = high + n - 2;
	string ans = string(2 * n, '?');

	vector<int> ball;
	rep(i, base_low, base_high + 1) ball.push_back(i);

	rep(i, 2 * n) {
		if(base_low <= i and i <= base_high) continue;
		ball.push_back(i);
		ans[i] = (output(ball) ? 'R' : 'B');
		ball.pop_back();
	}

	ball.clear();

	int red = 0, blue = 0;
	rep(i, 2 * n) {
		if(ans[i] == 'R' and red < (n - 1) / 2){
			ball.push_back(i);
			red++;
		}

		if(ans[i] == 'B' and blue < (n - 1) / 2){
			ball.push_back(i);
			blue++;
		}
	}

	rep(i, 2 * n) {
		if(ans[i] != '?') continue;
		ball.push_back(i);
		ans[i] = (output(ball) ? 'R' : 'B');
		ball.pop_back();
	}

	cout << "! " << ans << endl;

	return 0;
}

Measured memory_bytes: 724