//#pragma GCC optimize ("-O3","unroll-loops")
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;++i)
#define REPR(i, n) for(int i = n-1;i >= 0;--i)
#define FOR(i, m, n) for(int i = m;i < n;++i)
#define FORR(i, m, n) for(int i = m-1;i >= n;--i)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define pb(a) push_back
#define print(x) cout<<(x)<<endl
#define pe(x) cout<<(x)<<" "
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define lb(v,n) lower_bound(v.begin(), v.end(), n)
#define ub(v,n) upper_bound(v.begin(), v.end(), n)
#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")

template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int>P;
const int MOD = 1e9 + 7; const int MAX = 200020;
const double pi = acos(-1); const double EPS = 1e-12;
const ll INF = 2e18;

char ans[200];
void question(int l,int r) {
	cout << "?" << " ";
	FOR(i,l,r+1) {
		cout << i;
		if (i == r)cout << endl;
		else cout << " ";
	}
}
void question2(int l, int r, int x) {
	cout << "?" << " ";
	cout << x << " ";
	FOR(i, l, r + 1) {
		cout << i;
		if (i == r)cout << endl;
		else cout << " ";
	}
}

void solve() {
	int N; cin >> N;
	if (N == 1) {
		cout << "?" << " ";
		cout << 1 << endl;
		string S; cin >> S;
		if (S == "Red") {
			ans[1] = 'R';
			ans[2] = 'B';
		}
		else {
			ans[1] = 'B';
			ans[2] = 'R';
		}
		cout << "!" << " ";
		FOR(i, 1, 2 * N + 1) {
			cout << ans[i];
			if (i == 2 * N)cout << endl;
		}
		return;
	}
	int l = 1, r = N+1;
	string strL, strR;
	question(l, l + N - 1);
	cin >> strL;
	question(r, r + N - 1);
	cin >> strR;
	string pre;
	while (abs(r - l) > 1) {
		int mid = (r + l) / 2;
		question(mid, mid + N - 1);
		string tmp; cin >> tmp;
		if (tmp == strL)l = mid;
		else r = mid;
	}
	l = r;
	r = l + N - 2;
	FOR(i, 1, l) {
		question2(l, r, i);
		string now; cin >> now;
		if (now == "Red") {
			ans[i] = 'R';
		}
		else {
			ans[i] = 'B';
		}
	}
	FOR(i, r+1, 2*N+1) {
		question2(l, r, i);
		string now; cin >> now;
		if (now == "Red") {
			ans[i] = 'R';
		}
		else {
			ans[i] = 'B';
		}
	}
	vector<int>q;
	int remR = N/2, remB = N/2;
	FOR(i,1, 2 * N+1) {
		if (ans[i] == 'R'&&remR>0) {
			q.push_back(i); remR--;
		}
		else if (ans[i] == 'B'&&remB > 0) {
			q.push_back(i); remB--;
		}
	}
	FOR(i, l, r + 1) {
		cout << "?" << " ";
		REP(i, N-1) {
			cout << q[i] << " ";
		}
		cout << i << endl;
		string now; cin >> now;
		if (now == "Red") {
			ans[i] = 'R';
		}
		else {
			ans[i] = 'B';
		}
	}
	cout << "!" << " ";
	FOR(i, 1, 2 * N + 1) {
		cout << ans[i];
		if (i == 2 * N)cout << endl;
	}
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	solve();
}


Measured memory_bytes: 724