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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}


li res[222];
li n;

bool initial_rg;

inline bool get_rg() {
    string response;
    cin >> response;
    if (response == "-1")throw;
    return (response == "Red");
}

inline void send(li pos) {
    cout << "? ";
    rep(i, n) {
        cout << pos + i + 1;
        if (i < n - 1)cout << " ";
    }
    cout << endl;
}

int main() {
    cin >> n;
    rep(i, 2 * n) {
        res[i] = -1;
    }

    // initial question
    li left = 0;
    send(left);

    initial_rg = get_rg();
    li right = n;
    while (left + 1 < right) {
        li med = (left + right) / 2;
        send(med);
        bool rg = get_rg();
        if (rg == initial_rg) {
            left = med;
        } else {
            right = med;
        }
    }

    // send(left) = red, send(right) = blue
    res[left] = (initial_rg ? 1 : 2);
    res[left + n] = (initial_rg ? 2 : 1);

    rep(i, left) {
        cout << "? ";
        rep(j, n - 1) {
            cout << left + 2 + j << " ";
        }
        cout << i + 1 << endl;

        bool rg = get_rg();
        res[i] = (rg ? 1 : 2);
    }

    repp(i, left + n + 1, n * 2) {
        cout << "? ";
        rep(j, n - 1) {
            cout << left + 2 + j << " ";
        }
        cout << i + 1 << endl;

        bool rg = get_rg();
        res[i] = (rg ? 1 : 2);
    }

    vector<li> reds;
    vector<li> blues;
    rep(i, n * 2) {
        if (res[i] == 1) {
            reds.pb(i);
        } else if (res[i] == 2) {
            blues.pb(i);
        }
    }

    rep(i, n * 2) {
        if (res[i] == -1) {
            cout << "? ";
            rep(j, n / 2) {
                cout << reds[j] + 1 << " ";
            }
            rep(j, n / 2) {
                cout << blues[j] + 1 << " ";
            }
            cout << i + 1 << endl;
            bool rg = get_rg();
            res[i] = (rg ? 1 : 2);
        }
    }

    cout << "! ";
    rep(i, n * 2) {
        cout << (res[i] == 1 ? "R" : "B");
    }
    cout << endl;
    return 0;
}

Measured memory_bytes: 724