#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = (ll)1e9 + 7;
const int C = 15;

string hidden_string;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
T rand(T a, T b) {
	return uniform_int_distribution<T>(a, b)(rng);
}

// returns number of elements strictly smaller than v in vec
template<class T>
int bins(const vector<T>& vec, T v) {
	int low = 0;
	int high = vec.size();
	while(low != high) {
		int mid = (low + high) >> 1;
		if (vec[mid] < v) low = mid + 1;
		else high = mid;
	}
	return low;
}

ll query(const vector<ll>& input, int act_n) {
	int n = (int)input.size() - 1;
	
	cout << '?';
	for (int i = n - act_n; i <= n; ++i) cout << ' ' << (i == n - act_n ? 0 : input[i]);
	cout << endl;

	if (hidden_string.empty()) {
		ll res;
		cin >> res;
		return res;
	} else {
		ll res = input[n - act_n];
		for (int i = 0; i < act_n; ++i) {
			ll val = input[n - act_n + i + 1];
			if (hidden_string[i] == '+') res = (res + val) % MOD;
			else res = (res * val) % MOD;
		}
		return res;
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	vector<ll> vals(C + 1, 0);
	vector<pair<ll, int>> ord(1 << C);
	for (int ti = 0;; ++ti) {
		// cerr << ti << endl;
		for (int i = 1; i <= C; ++i) vals[i] = rand(0ll, MOD - 1);
		
		for (int mask = 0; mask < (1 << C); ++mask) {
			ll cur = vals[0];
			for (int i = 0; i < C; ++i) {
				if (mask & (1 << i)) cur = (cur * vals[i + 1]) % MOD;
				else cur = (cur + vals[i + 1]) % MOD;
			}
			ord[mask] = {cur, mask};
		}
		sort(ord.begin(), ord.end());
		
		bool works = 1;
		for (int i = 1; i < ord.size(); ++i) works &= (ord[i].first != ord[i - 1].first);
		if (works) break;
	}

	int act_n;
	cin >> act_n;
	int n = act_n;
	while(n % C != 0) ++n;

	// cin >> hidden_string;

	string ans(n, '?');
	vector<ll> input(n + 1, 0ll);
	for (int i = n, sub = 0; i >= C; i -= C) {
		for (int j = 0; j <= C; ++j) input[i - C + j] = vals[j];
		ll res = (query(input, act_n) + MOD - sub) % MOD;
		int mask = ord[bins(ord, {res, 0})].second;

		for (int j = 0; j < C; ++j) {
			int bit = (bool)(mask & (1 << j));
			ans[i - C + j] = "+x"[bit];
			input[i - C + j + 1] = 1;
			sub += 1 - bit;
		}
	}

	cout << "! ";
	for (int i = n - act_n; i < n; ++i) cout << ans[i];
	cout << endl;
}