#include<bits/stdc++.h>
using namespace std;
#define P 1000000007
#define debug(x) cout<<#x<<':'<<x<<endl;
typedef long long ll;
typedef pair<ll,ll> pii;
int main(){
    srand(time(0));
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    const int len = 18;
    vector<int> a{0,27839,23799,92601,31769,22312,74513,89169,61278,97412,65966,66643,40624,43850,78244,47784,96150,34012};

    // vector<int> a(100000);
    // for (int i = 0; i < 100000; ++i)
    //     a[i] = i;
    // while (true) {
        map<int, int> m;
        // random_shuffle(a.begin() + 1, a.end());
        // bool ff = true;
        for (int i = 0; i < (1 << (len - 1)); ++i) {
            int ans = a[0];
            for (int j = 0; j < (len - 1); ++j)
                if (i & (1 << j))
                    ans += a[j + 1], ans %= P;
                else 
                    ans = (1ll * ans * a[j + 1] % P);
            // if (m.count(ans)) {
            //     ff = false;
            //     break;
            // }
            // cout << (bitset<len>) i << ':' << ans << endl;
            m[ans] = i;
            // if (i == (0b10011010011110101))
            //     cout << ans << '!' << endl;
        }
    //     if (ff)
    //         break;
    // }
    // for (int i = 0; i < len; ++i)
    //     cout << a[i] << ',';
    // cout << endl;
    int n;
    cin >> n;
    vector<int> b(n + 1);
    vector<char> op(n + 1);
    int l = max(0, n - len + 1), r = n;
    while (r - l + 1 == len) {
        for (int i = 0; i < l; ++i)
            b[i] = 0;
        for (int i = l; i <= r; ++i)
            b[i] = a[i - l];
        for (int i = r + 1; i <= n; ++i)
            if (op[i] == 'x')
                b[i] = 1;
            else 
                b[i] = 0;
        cout << "? ";
        for (int i = 0; i <= n; ++i)
            cout << b[i] << ' ';
        cout << endl;
        int x;
        cin >> x;
        int ii = m[x];
        // cout << (bitset<len>)ii << endl;
        for (int i = 1; i < len; ++i)
            if (ii & (1 << (i - 1)))
                op[l + i] = '+';
            else 
                op[l + i] = 'x';
        // cout << l << ',' << r << endl;
        r = l, l = max(0, r - len + 1);
    }
        // cout << l << ',' << r << endl;
    while (r > l) {
        for (int j = 0; j < r; ++j)
            b[j] = 0;
        b[r] = 1;
        for (int i = r + 1; i <= n; ++i)
            if (op[i] == 'x')
                b[i] = 1;
            else 
                b[i] = 0;
        cout << "? ";
        for (int i = 0; i <= n; ++i)
            cout << b[i] << ' ';
        cout << endl;
        int x;
        cin >> x;
        if (x)
            op[r] = '+';
        else 
            op[r] = 'x';
        --r;
    }
    cout << "! ";
    for (int i = 1; i <= n; ++i)
        cout << op[i];
    cout << endl;
    return 0;
}
/*
+xx++x+xx++++x+x+
+x++x+x++xx++x+x+
10110101100110101
xx++x+xx++++x+x+
*/