#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 1e9 + 7;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

int k = 15, b[16];
map<int, int> mt;

int n;
bool op[N], ans[N];
int a[N];

int ask() {
    cout << "? ";
    for (int i = 0; i <= n; i++)
        cout << a[i] << " ";
    cout << "\n";
    cout.flush();
    int res;
    cin >> res;
    return res;
//    int res = a[0];
//    for (int i = 0; i < n; i++) {
//        if (op[i])
//            res = mult(res, a[i + 1]);
//        else
//            res = sum(res, a[i + 1]);
//    }
//    return res;
}

void solve() {
    b[0] = 41;
    b[1] = 27;
    b[2] = 73;
    b[3] = 37;
    b[4] = 12;
    b[5] = 69;
    b[6] = 68;
    b[7] = 30;
    b[8] = 83;
    b[9] = 31;
    b[10] = 63;
    b[11] = 24;
    b[12] = 68;
    b[13] = 36;
    b[14] = 30;
    b[15] = 3;
    for (int i = 0; i < (1 << k); i++) {
        int res = b[0];
        for (int j = 0; j < k; j++) {
            if ((i >> j) & 1)
                res = mult(res, b[j + 1]);
            else
                res = sum(res, b[j + 1]);
        }
        mt[res] = i;
    }
    for (int i = 0; i < (1 << k); i++) {
        int res = 0;
        for (int j = 0; j < k; j++) {
            if ((i >> j) & 1)
                res = mult(res, b[j + 1]);
            else
                res = sum(res, b[j + 1]);
        }
        mt[res] = i;
    }

    cin >> n;
//    n = 4000;

//    for (int i = 0; i < n; i++)
//        op[i] = rand() % 2;

    int cnt = 0;
    int ptr = n - 1;
    while (ptr >= 0) {
        cnt++;
        assert(cnt <= 275);
        int l = ptr - k + 1;
        for (int i = 0; i <= n; i++)
            a[i] = 0;
        for (int i = 0; i <= k; i++)
            if (l + i >= 0)
                a[l + i] = b[i];
        for (int i = l + k; i < n; i++)
            if (i + 1 >= 0)
                a[i + 1] = ans[i];


        int res = ask();
        res = mt[res];
        for (int i = 0; i < k; i++)
            if (l + i >= 0)
                ans[l + i] = ((res >> i) & 1);

        ptr -= k;

    }

//    for (int i = 0; i < n; i++)
//        cerr << ans[i];
//    cerr << endl;
//    for (int i = 0; i < n; i++)
//        cerr << op[i];
//    cerr << endl;

    cout << "! ";
    for (int i = 0; i < n; i++)
        cout << "+x"[ans[i]];
    cout << "\n";
    cout.flush();

//    for (int i = 0; i < n; i++)
//        assert(ans[i] == op[i]);
}

int main() {
    srand(time(0));
//#ifdef DEBUG
//    freopen("input.txt", "r", stdin);
//#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}