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

#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint=vector<int>;
using vvint=vector<vint>;
using pint=pair<int, int>;
using vpint=vector<pint>;
template<typename T> using priority_queue_rev=priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028L;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

long long discrete_binary_search(long long ok, long long ng, const std::function<bool(long long)> &check) {
    while (abs(ok - ng) > 1) {
        long long mid = (ok + ng) / 2;
        (check(mid) ? ok : ng) = mid;
    }
    return ok;
}

int N;
signed main() {
    cin >> N;
    cout << "? ";
    reps(i, N) { cout << i << " "; }
    cout << endl;
    string res;
    cin >> res;
    string left = res;
    string right = res == "Red" ? "Blue" : "Red";
    int trans = discrete_binary_search(1, N + 1, [&](int x) {
        cout << "? ";
        for (int i = x; i < x + N; i++) { cout << i << " "; }
        cout << endl;
        cin >> res;
        return left == res;
    });
    vint a, b;
    for (int i = trans + 1; i < trans + N; i++) { a.push_back(i); }
    for (int i = 1; i < trans; i++) { b.push_back(i); }
    for (int i = trans + N + 1; i <= 2 * N; i++) { b.push_back(i); }
    vector<string> ans(2 * N + 1);
    ans[trans] = left;
    ans[trans + N] = right;
    reps(i, 2 * N) {
        if (i < trans || i > trans + N) {
            cout << "? ";
            rep(i, N - 1) { cout << a[i] << " "; }
        } else if (trans < i && i <= trans + N) {
            cout << "? ";
            rep(i, N - 1) { cout << b[i] << " "; }
        } else { continue; }
        cout << i << endl;
        cin >> ans[i];
    }
    cout << "! ";
    reps(i, 2 * N) { cout << ans[i][0]; }
    cout << endl;
}


Measured memory_bytes: 724