#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 4e3+3;
const ll mod = 1e9+7;

ll ans[N],a[N];

mt19937 rng((unsigned long long) new char);

ll rnd(ll l=0,ll r=mod-1){
	return rng()%(r-l+1)+l;
}

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

	bool fl=1;
	unordered_map<ll,ll> mp;
	ll v=0;
	while (fl){
		fl=0;
		mp.clear();
		v=rnd();
		for (int i=0; i<(1<<15); i++){
			ll t=0;
			for (int j=0; j<15; j++){
				if (i>>j&1) t=t*v%mod;
				else t=(t+v)%mod;
			}
			if (mp.count(t)){
				fl=1;
				break;
			}
			mp[t]=i;
		}
	}
	int n;
	cin>>n;
	for (int i=n; i>0; i-=15){
		for (int j=0; j<=n; j++){
			if (j<=i-15 || j==0) a[j]=0;
			else if (j<=i) a[j]=v;
			else a[j]=ans[j-1];
		}
		cout<<"? ";
		for (int j=0; j<=n; j++){
			cout<<a[j]<<" ";
		}
		cout<<endl;
		ll res;
		cin>>res;
		ll msk=mp[res];
		for (int j=0; j<15; j++){
			if (i-15+j>=0) ans[i-15+j]=(msk>>j)&1;
		}
	}
	cout<<"! ";
	for (int i=0; i<n; i++){
		if (ans[i]==0) cout<<"+";
		else cout<<"x";
	}
	return 0;
}

// TRY! TRY! TRY!

/*
Think twice before coding. Have you overkilled?
Think twice before submitting.
Check on the samples and constraints carefully.
*/

/*
Be brave to guess.
Is your former/first approach correct?
Follow your intuition.
Use a notebook to note down your ideas and check whether they are correct.
*/

/*
A simple brute force may work? There is some limit on the answer?
Try to find patterns.
*/