#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=1e5+5;
int n,Dfn[N],B[N],Sz[N],TOT;
vector<int>E[N],S;
void Dfs(int x)
{
	Dfn[x]=++TOT;B[TOT]=x,Sz[x]=1;
	S.pb(TOT);
	for(int i:E[x])
	{
		Dfs(i);
		Sz[x]+=Sz[i];
	}
}
inline void Pt(int x)
{
	if(x>9)Pt(x/10);
	putchar('0'+x%10);
}
inline void Work(vector<int>&S,int L,int R)
{
	if(S.empty())return;
	if(L==R)return putchar('='),Pt(B[L]),void();
	vector<int>LS,RS;
	int Mid=L+R>>1,l=L-1,r=R+1;
	for(int i:S)
	{
		if(i+Sz[B[i]]-1<Mid)LS.pb(i);
		else if(Mid<i)RS.pb(i);
		else
		{
			while(l<i-1)putchar('+'),Pt(B[++l]);
			while(r>i+Sz[B[i]])putchar('+'),Pt(B[--r]);
			putchar('='),Pt(B[i]);
		}
	}
	for(int i=L;i<=l;i++)putchar('-');
	for(int i=r;i<=R;i++)putchar('-');
	putchar('+'),Pt(B[Mid]);
	if(L<=Mid-1&&!LS.empty())
	{
		for(int i=Mid+1;i<=R;i++)putchar('+'),Pt(B[i]);
		Work(LS,L,Mid-1);
		for(int i=Mid+1;i<=R;i++)putchar('-');		
	}
	if(Mid+1<=R&&!RS.empty())
	{
		for(int i=L;i<=Mid-1;i++)putchar('+'),Pt(B[i]);
		Work(RS,Mid+1,R);
		for(int i=L;i<=Mid-1;i++)putchar('-');
	}
	putchar('-');
}
int main()
{
	while(~scanf("%d",&n))
	{
		TOT=0,S.clear();
		for(int i=1;i<=n;i++)
		{
			Dfn[i]=B[i]=Sz[i]=0;
			E[i].clear();
		}
		for(int i=2,x;i<=n;i++)
		{
			scanf("%d",&x);
			E[x].pb(i);
		}
		Dfs(1);
		Work(S,1,n);
		putchar('!'),putchar('\n');
	}
	
}