#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define RFOR(i, b, a) for(int i = b - 1; i >= a; --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)

#define MIN(A, B) ((A) < (B) ? (A) : (B))
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#define ABS(A) ((A) < 0 ? (-(A)) : (A))
#define ALL(V) V.begin(), V.end()
#define SIZE(V) (int)V.size()
#define pb push_back
#define mp make_pair
#define EPS 1e-7
#define Pi 3.14159265358979
#define FILL(a,v) memset(a,v,sizeof(a))

using namespace std;

typedef long long Long;
typedef unsigned long long ULong;
typedef unsigned int Uint;
typedef unsigned char Uchar;
typedef vector <int> VI;
typedef pair <int, int> PII;

#define X first
#define Y second

typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.X >> p.Y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.X << ' ' << p.Y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return (ui)(8*sizeof(int)-__builtin_clz(x)); }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};

void fastIO(){ios::sync_with_stdio(false); }

int n;


bool flip = false;

int tot = 0;
string okAns;
void prepare() {
    tot = 0;
    flip = false;
    okAns = string(" ", 2*n);
    VI a(2*n);
    REP(i, a.size())
        a[i] = i;
    random_shuffle(ALL(a));
    REP(i, n)
        okAns[a[i]] = 'B';
    FOR(i,n,2*n)
        okAns[a[i]] = 'R';
}


string simulate(const VI &v) {
    if (tot >= 210) {
        cout << "SLOW!" << endl;
        exit(0);
    }
    ++tot;
    int cnt = 0;
    for(auto val: v) {
        if (okAns[val-1] == 'B')
            ++cnt;
        else
            --cnt;
    }
    return (cnt > 0)?"Blue":"Red";
}


bool ask(const VI& v) {
    assert (v.size() == n);
    cout << "?";
    for(auto a: v)
        cout << " " << a;
    cout << endl;

//    string s;
//    cin >> s;
    auto s = simulate(v);
    cin >> s;
    assert(s == "Red" || s == "Blue");

    return (s == "Blue")^flip;
}


VI buildP(int prefsize) {
    VI v;
    FOR(i, 1, n+1) {
        if (i <= prefsize)
            v.pb(n+i);
        else
            v.pb(i);
    }
    return v;
}

bool askP(int prefsize) {
    VI v = buildP(prefsize);
    return ask(v);
}


void chk(const VI&v) {
    return;
    int cnt = 0;

    for(auto val: v) {
        if (okAns[val-1] == 'B')
            ++cnt;
        else
            --cnt;
    }

    assert(cnt == 0);
}



int main() {
    fastIO();

    int seed = 1574515003;
//    while(true)
    {
        seed = time(NULL);
        srand(seed);
//        cout << seed << endl;

        n = 45;
        cin >> n;
        prepare();
//        okAns = "BRBBRBBRRR";
//        cout << okAns << endl;


        bool isBlue = askP(0);

        if (!isBlue)
            flip = true;

        VI ans(2 * n, -1);

        int l = 0;
        int r = n;

        while (r - l > 1) {
            int m = (r + l) / 2;
            if (askP(m))
                l = m;
            else
                r = m;
        }

    //    cout << l << endl;

        ans[l] = 1;
        ans[l+n] = 0;


        VI tmp = buildP(l);
        set<int> a(ALL(tmp));

        a.erase(l + 1);

        VI v(ALL(a));

        chk(v);


        FOR(i, 1, 2 * n + 1) {
            if (a.count(i) || ans[i - 1] != -1)
                continue;
            v.pb(i);
            ans[i - 1] = ask(v);
            v.pop_back();
        }

        a.clear();

        VI red;
        VI blue;

        FOR(i, 1, 2 * n + 1) {
            if (ans[i - 1] == 1)
                blue.pb(i);
            else if (ans[i - 1] == 0)
                red.pb(i);
        }

        assert(red.size() >= n / 2);
        assert(blue.size() >= n / 2);

    //    cout << red << blue << endl;


        REP(i, n / 2) {
            a.insert(red[i]);
            a.insert(blue[i]);
        }

        v = VI(ALL(a));

        chk(v);


        FOR(i, 1, 2 * n + 1) {
            if (a.count(i) || ans[i - 1] != -1)
                continue;
            v.pb(i);
            ans[i - 1] = ask(v);
            v.pop_back();
        }

        cout << "! ";
        string anss;
        for (auto val: ans) {
            bool isB = val;
            isB ^= flip;

            if (isB) {
                anss += "B";
            } else {
                anss += "R";
            }
        }

        cout << anss << endl;
        if (anss != okAns) {
            cout << "BAD !" << okAns << endl;
            exit(0);
        }
    }


//    cout << "! ";
//
//    for(auto v: f) {
//        if (v > 0) {
//            cout << "B";
//        } else {
//            cout << "R";
//        }
//    };
//
//    cout << endl;
//

    return 0;
}





Measured memory_bytes: 724