#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
#define IOS cin.tie(0),ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
template<class Type>struct is_vector : std::false_type {};
template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T> inline ostream& operator << (ostream& out, const vector<T>& v) {
	if (v.empty())return out;
	constexpr bool is_vector_v = is_vector<T>::value;
	if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
	else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
	return out;
}
inline void put() {}
template<class T> inline void put(const T& first) { std::cout << first << "\n"; }
template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }
inline void putn() {}
template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }

int n;

void que(int m) {
	cout << "?" << " ";
	FOR(i, m, m + n) {
		cout << i + 1 << " ";
	}
	put("");
	cout << flush;
}

void que2(int m) {
	cout << "?" << " ";
	FOR(i, m, m + n - 1) {
		cout << i + 1 << " ";
	}
}

int main() {
	IOS;
	cin >> n;
	vector<int> a(n * 2, -1);
	int r = n;
	int l = 0;
	
	que(0);
	string c;
	cin >> c;
	if (c == "-1") {
		return 1;
	}
	int rc, lc;
	lc = (c[0] == 'R');
	rc = 1 - lc;
	while (r - l > 1) {
		int mid = (r + l) / 2;
		que(mid);
		cin >> c;
		if (c == "-1") {
			return 1;
		}
		if (lc != (c[0]=='R')) {
			r = mid;
		} else {
			l = mid;
		}
	}
	a[l] = lc;
	a[l + n] = rc;
	queue<int> li;
	vector<int> li2;
	vector<int> li3;
	REP(i, l) {
		li.push(i);
		li2.push_back(i);
	}
	FOR(i, r + n , n * 2) {
		li.push(i);
		li2.push_back(i);
	}
	FOR(i, r, r + n - 1) {
		li3.push_back(i);
	}
	REP(i, n - 1) {
		int p = li.front();
		li.pop();
		que2(l + 1);
		put(p + 1);
		cout << flush;
		cin >> c;
		if (c == "-1") {
			return 1;
		}
		a[p] = (c[0] == 'R');
	}
	REP(i, n - 1) {
		cout << "? ";
		for (auto v : li2) {
			cout << v+1 << " "; 
		}
		put(li3[i]+1);
		cout << flush;
		cin >> c;
		if (c == "-1") {
			return 1;
		}
		a[li3[i]] = (c[0] == 'R');
	}
	cout << "! ";
	REP(i, n * 2) {
		if (a[i] == 0) {
			cout << "B";
		} else {
			cout << "R";
		}
	}
	put("");
	cout << flush;
 	return 0;
}


Measured memory_bytes: 724