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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


int apicallcount = 0;

int ask(vi& nums, int from, int to){
    printf("?");
    for (int i=from; i<to; ++i){
        printf(" %d", 1+nums[i]);
    }
    printf("\n");
    fflush(stdout);

    string v; cin >> v;
    ++apicallcount;

    if (v[0] == '-') return -1;
    return (int)v[0];
}

void ans(vi& pat){
    printf("! ");
    rep(i, pat.size()){
        putchar(pat[i]);
    }
    printf("\n");
    fflush(stdout);
}

void solve(int N){
    vi a(N*2); rep(i,N*2) a[i] = i;

    set<int> unk;
    rep(i,N*2) unk.insert(i);
    map<int,int> deja;

    int lo=0, loF = ask(a,lo,lo+N);
    int hi=N, hiF = (loF=='R')?'B':'R';

    while (lo+1 < hi) {
        int mi = (lo+hi)/2;
        int miF = ask(a,mi,mi+N);
        if (loF == miF){
            lo = mi;
        } else {
            hi = mi;
        }
    }

    deja[lo] = loF; unk.erase(lo);
    deja[lo+N] = hiF; unk.erase(lo+N);

    for(int i=0; i<lo; ++i){
        a[lo] = i;
        deja[i] = ask(a,lo,lo+N);
        unk.erase(i);
    }
    for(int i=lo+N+1; i<N*2; ++i){
        a[lo] = i;
        deja[i] = ask(a,lo,lo+N);
        unk.erase(i);
    }

    a.assign(N,-1);
    int H=(N-1)/2, ac=0, bc=0, i=0;
    for (auto& p: deja){
        if (ac==H && bc==H) break;
        switch (p.second){
            case 'R':
                if (ac<H) {
                    a[i++] = p.first;
                    ++ac;
                }
                break;
            case 'B':
                if (bc<H) {
                    a[i++] = p.first;
                    ++bc;
                }
                break;
        }
    }
    assert(i==N-1);

    for (int n: unk){
        a[N-1] = n;
        deja[n] = ask(a,0,N);
    }

    vi pat(N*2, '?');
    rep(i,2*N){
        pat[i] = deja[i];
    }
    ans(pat);
}

int main() {
    int N; cin >> N;
    solve(N);
    return 0;
}


Measured memory_bytes: 724