#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1000000007;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }

// 0: red, 1: blue

int query(vector<bool> array){
    cout << "?";
    for(int i = 0; i < array.size(); i++){
        if(array[i]){
            cout << " " << i + 1;
        }
    }
    cout << endl;
    string ret;
    cin >> ret;
    assert(ret != "-1");
    if(ret == "Red"){
        return 0;
    }else{
        return 1;
    }
}

int answer(vector<int> array){
    cout << "! ";
    for(int i = 0; i < array.size(); i++){
        if(array[i] == 0){
            cout << "R";
        }else{
            cout << "B";
        }
    }
    cout << endl;
    exit(0);
}

int main(){
    int N;
    cin >> N;
    vector<bool> arr = vector<bool>(N * 2, false);
    for(int i = 0; i < N; i++){
        arr[i] = true;
    }
    int left = query(arr);
    int low = 0, high = N; // (low, high]
    while(low + 1 < high){
        int mid = (low + high) / 2;
        arr = vector<bool>(N * 2, false);
        for(int i = 0; i < N - mid; i++){
            arr[i] = true;
        }
        for(int i = 0; i < mid; i++){
            arr[i + N] = true;
        }
        int ret = query(arr);
        if(ret == left){
            low = mid;
        }else{
            high = mid;
        }
    }
    vector<int> ans(N * 2, -1);
    arr = vector<bool>(N * 2, false);
    for(int i = 0; i < N - high; i++){
        arr[i] = true;
    }
    for(int i = 0; i < high - 1; i++){
        arr[i + N] = true;
    }
    for(int i = N - high; i < N; i++){
        arr[i] = true;
        ans[i] = query(arr);
        arr[i] = false;
    }
    for(int i = high - 1; i < N; i++){
        arr[i + N] = true;
        ans[i + N] = query(arr);
        arr[i + N] = false;
    }
    bool red = false, blue = false;
    arr = vector<bool>(N * 2, false);
    for(int i = N - high; i < N; i++){
        if(ans[i] == 0 && !red){
            red = true;
            continue;
        }else if(ans[i] == 1 && !blue){
            blue = true;
            continue;
        }
        arr[i] = true;
    }
    for(int i = high - 1; i < N; i++){
        if(ans[i + N] == 0 && !red){
            red = true;
            continue;
        }else if(ans[i + N] == 1 && !blue){
            blue = true;
            continue;
        }
        arr[i + N] = true;
    }
    
    for(int i = 0; i < N - high; i++){
        arr[i] = true;
        ans[i] = query(arr);
        arr[i] = false;
    }
    for(int i = 0; i < high - 1; i++){
        arr[i + N] = true;
        ans[i + N] = query(arr);
        arr[i + N] = false;
    }
    answer(ans);
}


Measured memory_bytes: 724