//include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int MOD = 1000000007;

// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};

//debug
//--------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl

//IO accelerate
//--------------------------------------------
//struct InitIO {
//    InitIO() {
//        cin.tie(nullptr);
//        ios_base::sync_with_stdio(false);
//        cout << fixed << setprecision(30);
//    }
//} init_io;

//template
//--------------------------------------------
template<typename T>
istream& operator >>(istream& is, vector<T>& vec) {
  for(T& x: vec) is >> x;
  return is;
}
template<typename T>
ostream& operator <<(ostream& os, const vector<T>& vec) {
  for(int i=0; i<vec.size(); i++){
    os << vec[i] << ( i+1 == vec.size() ? "" : "\t" );
  }
  return os;
}
template<typename T>
ostream& operator <<(ostream& s, const vector<vector<T>>& vv) {
	for (int i = 0; i < vv.size(); ++i) {
		s << vv[i] << endl;
	}
	return s;
}
template<typename T>
ostream& operator <<(ostream& s, const vector<pair<T, T>>& vp) {
	for (int i = 0; i < vp.size(); ++i) {
		s << "(" << vp[i].first << "," << vp[i].second << ")" << ( i+1 == vp.size() ? "" : ",\t" );
	}
	return s;
}

// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

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

// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}

//main code

int main(int argc, char const* argv[])
{
	int n;
	cin >> n;
	vector<char> ans(2*n+1,'x');
	VL q(n+1);
	int count = 0;
	auto out_q = [&](){
		if (count > 210) {
			cerr << "質問回数オーバー";
			exit(0);
		}
		count++;
		cout << '?' << " ";
		for (int i = 1; i <= n; i++) {
			cout << q[i] << " ";
		}
		cout << endl;
	};
	char lc, rc;
	for (int i = 1; i <= n; i++) {
		q[i] = i;
	}
	out_q();
	string res;
	cin >> res;
	if (res == "Red") {
		lc = 'R';
		rc = 'B';
	} else {
		lc = 'B';
		rc = 'R';
	}

	// 赤と青が切り替わるところをにぶたん
	//条件式
	auto isRed = [&](LL mid){
		//ここになにか書く
		for (int i = 1; i <= n; i++) {
			q[i] = mid+i-1;
		}
		out_q();
		string res;
		cin >> res;
		if (res == "Red") {
			return true;
		} else {
			return false;
		}
	};
	//上界，下界が自明なら小さくしても良い
	LL l = 1, r = n+1;
	while (r - l > 1) {
		dump(l);
		dump(r);
		LL mid = (l + r) / 2;
		if (lc == 'R') {
			(isRed(mid) ? l: r) = mid;
		} else {
			(isRed(mid) ? r: l) = mid;
		}
	}
	if (r == n+2 or l == 0) {cerr << "にぶたんバグった" << endl; exit(0);}
	if (lc == 'R') {
		ans[l] = 'R';
		ans[r+n-1] = 'B';
	} else {
		ans[l] = 'B';
		ans[r+n-1] = 'R';
	}
	VL s1,s2;
	for (int i = 1; i <= 2*n; i++) {
		if (i > l and i < l+n) {
			s1.push_back(i);
		} else if (i != l and i != l+n) {
			s2.push_back(i);
		}
	}
	if (s1.size() != n-1 or s2.size() != n-1) {
		cerr << "s1, s2のサイズが違う" << endl;
	}
	dump(s1);
	dump(s2);
	for (int i = 1; i <= 2*n; i++) {
		if (ans[i] != 'x') {
			continue;
		}
		dump(i);
		q[1] = i;
		if (binary_search(ALL(s1), i)) {
			for (int j = 0; j < n-1; j++) {
				q[j+2] = s2[j];
			}
		} else {
			for (int j = 0; j < n-1; j++) {
				q[j+2] = s1[j];
			}
		}
		out_q();
		string res;
		cin >> res;
		ans[i] = res[0];
		dump(ans);
	}

	cout << "! ";
	for (int i = 1; i <= 2*n; i++) {
		cout << ans[i];
	}
	cout << endl;
	return 0;
}


Measured memory_bytes: 724