//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
vector<int> G[100100];
int dfn[100100],out[100100],val[100100],n,tot;
void dfs(int x)
{
	dfn[x]=++tot;
	val[tot]=x;
	for(auto y:G[x])
		dfs(y);
	out[x]=tot;
}
void solve(int l,int r,vector<array<int,3>> vq)
{
	if(!sz(vq)) return ;
	if(l==r)
	{
		for(auto arr:vq)
			cout<<"="<<arr[2];
		return ;
	}
	int mid=(l+r)/2;
	vector<array<int,3>> vl,vr,vmid;
	for(auto arr:vq)
		if(arr[1]<=mid)
			vl.pb(arr);
		else if(arr[0]>mid)
			vr.pb(arr);
		else
			vmid.pb(arr);
	for(int i=l;i<=mid;i++)
		cout<<"+"<<val[i];
	solve(mid+1,r,vr);
	for(int i=l;i<=mid;i++)
		cout<<"-";
	for(int i=mid+1;i<=r;i++)
		cout<<"+"<<val[i];
	solve(l,mid,vl);
	srt(vmid);
	int lp=l,rp=r;
	for(auto arr:vmid)
	{
		while(lp<arr[0])
			cout<<"+"<<val[lp++];
		while(rp>arr[1])
			cout<<"+"<<val[rp--];
		cout<<"="<<arr[2];
	}
	while(lp>l)
	{
		cout<<"-";
		lp--;
	}
	while(rp<r)
	{
		cout<<"-";
		rp++;
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	while(cin>>n)
	{
		tot=0;
		for(int i=1;i<=n;i++)
			G[i].clear();
		for(int i=2;i<=n;i++)
		{
			int f;
			cin>>f;
			G[f].pb(i);
		}
		dfs(1);
		vector<array<int,3>> vec;
		for(int i=1;i<=n;i++)
			vec.push_back({dfn[i],out[i],i});
		solve(1,n,vec);
		cout<<"!\n";
	}
	return 0;
}