#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
using namespace std;
const int N=1e5+5;
int n,par[N],L[N],R[N],rev[N],tot;
vector<int>v[N];
void dfs(int x){
	L[x]=R[x]=++tot;rev[tot]=x;
	for(int i=0;i<v[x].size();i++){
		dfs(v[x][i]);
		R[x]=max(R[x],R[v[x][i]]);
	}
}
struct line{int l,r,id;};
vector<line>tree[N<<2];
bool cmp(line x,line y){return x.l<y.l;}
#define lc k<<1
#define rc k<<1|1
#define ls lc,l,mid
#define rs rc,mid+1,r 
void change(int k,int l,int r,int x,int y,int id){
	int mid=l+r>>1;
	if((l==r)||(x<=mid&&mid<y)){
		tree[k].push_back(line{x,y,id});
		return ;
	}
	if(x<=mid) change(ls,x,y,id);
	if(mid<y) change(rs,x,y,id);
}
void work(int k,int l,int r){
	sort(tree[k].begin(),tree[k].end(),cmp);
	int L=l,R=r,mid=l+r>>1;
	for(int i=0;i<tree[k].size();i++){
		while(L<tree[k][i].l){printf("+%d",rev[L]);L++;}
		while(tree[k][i].r<R){printf("+%d",rev[R]);R--;}
		printf("=%d",tree[k][i].id);
	}
	while(l<L){printf("-");L--;};
	while(R<r){printf("-");R++;};
	if(l==r) return ;
	for(int i=mid+1;i<=r;i++) printf("+%d",rev[i]);
	work(ls);
	for(int i=mid+1;i<=r;i++) printf("-");
	for(int i=l;i<=mid;i++) printf("+%d",rev[i]);
	work(rs);
	for(int i=l;i<=mid;i++) printf("-");
}
int main(){
	while(~scanf("%d",&n)){
		for(int i=2;i<=n;i++){
			scanf("%d",&par[i]);
			v[par[i]].push_back(i);
		}
		tot=0;dfs(1);
		for(int i=1;i<=n;i++) change(1,1,n,L[i],R[i],i);
		work(1,1,n);
		for(int i=1;i<=n;i++) v[i].clear();
		for(int i=1;i<=n*4;i++) tree[i].clear();
		puts("!");
	}
	return 0;
}