#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    //ios::sync_with_stdio(false); cin.tie(nullptr);

    int LOCAL = 0;
    int N; cin >> N;
    string c;
    if (LOCAL) {
        cin >> c;
    }
    
    string col;
    if (LOCAL) {
        int r = 0, b = 0;
        rep(i,N) {
            if (c[i]=='R') r++;
            else b++;
            if (r > b) col = "Red";
            else col = "Blue";
        }
    } else {
        cout << "?";
        for (int i = 1; i <= N; i++) cout << " " << i;
        cout << endl;
        cin >> col;
    }
    int L = LOCAL ? 0 : 1;
    int R = LOCAL ? N : N+1;
    while (R-L>1) {
        int m = (L+R)/2;
        string s;
        if (LOCAL) {
            int r = 0, b = 0;
            for (int i = m; i < m+N; i++) {
                if (c[i]=='R') r++;
                else b++;
            }
            if (r>b) s = "Red";
            else s = "Blue";
        } else {
            cout << "?";
            for (int i = m; i < m+N; i++) cout << " " << i;
            cout << endl;
            cin >> s;
        }
        if (s==col) L = m;
        else R = m;
    }

    string ans = string(2*N,' ');
    rep(i,2*N) {
        if (LOCAL) {
            int r = 0, b = 0;
            if (i <= L or i >= L+N) {
                for (int j = R; j < L+N; j++) {
                    if (c[j]=='R') r++;
                    else b++;
                }
            } else {
                for (int j = 0; j < L; j++) {
                    if (c[j]=='R') r++;
                    else b++;
                }
                for (int j = R+N; j < 2*N; j++) {
                    if (c[j]=='R') r++;
                    else b++;
                }
            }
            if (c[i]=='R') r++;
            else b++;
            if (r>b) ans[i] = 'R';
            else ans[i] = 'B';
        } else {
            int ii = i+1;
            cout << "?";
            if (ii <= L or ii >= L+N) {
                for (int j = R; j < L+N; j++) {
                    cout << " " << j;
                }
            } else {
                for (int j = 1; j < L; j++) {
                    cout << " " << j;
                }
                for (int j = R+N; j <= 2*N; j++) {
                    cout << " " << j;
                }
            }
            cout << " " << ii << endl;
            string s; cin >> s;
            if (s=="Red") ans[i] = 'R';
            else ans[i] = 'B'; 
        }
    }

    if (LOCAL) {
        cout << (ans==c ? "OK" : "NG") << endl;
    } else {
        cout << "! " << ans << endl;
    }
    return 0;
}


Measured memory_bytes: 3844