#include <bits/stdc++.h>
// created [2019/11/23] 21:33:04
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)

template<typename T>
std::vector<T> make_v(const usize size, const T v) { return std::vector<T>(size, v); }
template<typename... Args>
auto make_v(const usize size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
int main()
{
    const int N = read<int>();

    auto ask = [&](const std::vector<int>& A) -> int {  // 0:r>b, 1:r<b
        static int Q = 0;
        Q++;
        assert(Q <= 210);
        assert(A.size() == N);
        std::cout << "?";
        for (const int e : A) { std::cout << " " << e + 1; }
        std::cout << std::endl;
        const auto rep = read<std::string>();
        assert(rep != "-1");
        return (rep == "Blue" ? 1 : 0);
    };
    auto answer = [&](const std::vector<int>& Ans) {
        assert(Ans.size() == 2 * N);
        std::cout << "! ";
        for (const int e : Ans) { std::cout << (e == 0 ? 'R' : 'B'); }
        std::cout << std::endl;
    };
    std::vector<int> ren(2 * N, -1);
    std::vector<int> ans(2 * N, -1);
    auto hoge = [&](const int i) -> int {
        if (ren[i] != -1) { return ren[i]; }
        std::vector<int> A;
        for (int j = 0; j < N; j++) { A.push_back((i + j) % (2 * N)); }
        return ren[i] = ask(A);
    };

    int inf = -1, sup = N;
    int r = -1, b = -1;
    while (sup - inf > 1) {
        const int mid                      = (inf + sup) / 2;
        (hoge(mid) == hoge(0) ? inf : sup) = mid;
    }
    (ren[inf] == 0 ? r : b) = inf;
    (ren[inf] == 0 ? b : r) = inf + N;
    assert(r != -1 and b != -1);
    std::vector<int> L, R;
    for (int i = (r + 1) % (2 * N); i != b; (i += 1) %= (2 * N)) { L.push_back(i); }
    for (int i = (b + 1) % (2 * N); i != r; (i += 1) %= (2 * N)) { R.push_back(i); }
    SHOW(r, b);
    ans[r] = 0, ans[b] = 1;
    SHOW(L, R);
    for (const int e : L) {
        std::vector<int> a{r, b};
        for (const int e2 : L) {
            if (e2 == e) { continue; }
            a.push_back(e2);
        }
        const int blue = ask(a);
        ans[e]         = 1 - blue;
    }
    for (const int e : R) {
        std::vector<int> a{r, b};
        for (const int e2 : R) {
            if (e2 == e) { continue; }
            a.push_back(e2);
        }
        const int blue = ask(a);
        ans[e]         = 1 - blue;
    }
    SHOW(ans);
    answer(ans);
    return 0;
}


Measured memory_bytes: 724