#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
//#define int ll
//#define N
using namespace std;
const int N=100005;
int dfn[N],idfn[N],rdfn[N];
int DFN;
poly G[N];
vector<pa>all;
int n;
void add(int x)
{
	cout<<"+"<<x;
}
void undo()
{
	cout<<"-";
}
void dfs(int k,int fa)
{
	dfn[k]=++DFN;
	idfn[DFN]=k;
	for (auto u:G[k])
	{
		if (u==fa) continue;
		dfs(u,k);
	}
	rdfn[k]=DFN;
	all.push_back(mp(dfn[k],rdfn[k]));
}
int lpos,rpos;
void work(int l,int r,vector<pa>all)
{
	if (l>r) return;
	int mid=l+(r-l)/2;
	vector<pa>lf,rt;
	for (auto [x,y]:all)
		if (x<=mid&&y>=mid)
		{
			while (lpos<x) 
			{
				add(idfn[lpos++]);
			}
			while (rpos>y)
			{
				add(idfn[rpos--]);
			}
			cout<<"="<<idfn[x];
		} else
		if (y<mid) lf.push_back(mp(x,y));
		else if (x>mid) rt.push_back(mp(x,y));
	if (l==r) return;
	while (lpos>l)
	{
		undo();
		lpos--;
	}
	while (rpos<r)
	{
		undo();
		rpos++;
	}
	if (l<mid)
	{
		while (rpos>=mid)
		{
			add(idfn[rpos--]);
		}
		work(l,mid-1,lf);
		while (rpos<r) undo(),rpos++;
	}
	if (r>mid)
	{
		while (lpos<=mid)
		{
			add(idfn[lpos++]);
		}
		work(mid+1,r,rt);
		while (lpos>l) undo(),lpos--;
	}
}
void BellaKira()
{
	for (int i=1;i<n;i++)
	{
		int x;
		cin>>x;
		// cout<<x<<" "<<i+1<<endl;
		G[x].push_back(i+1);
	}
	dfs(1,0);
	lpos=1,rpos=n;
	reverse(all.begin(),all.end());
	work(1,n,all);
	cout<<'\n';
	for (int i=1;i<=n;i++) poly().swap(G[i]);
	DFN=0;
	vector<pa>().swap(all);
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (cin>>n)
	{
		BellaKira();
	}
}