#include<iostream>
#include<cstdio>
#include<vector>
#define N 100000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,dfn[N+1],rev[N+1],leng,sz[N+1];
vector<int>E[N+1];
void dfs(int x)
{
	dfn[x]=++leng,rev[dfn[x]]=x,sz[x]=1;
	for (int i=0;i<E[x].size();++i) dfs(E[x][i]),sz[x]+=sz[E[x][i]];
	return;
}
void adder(int x)
{
	printf("+%d",x);
	return;
}
void undo()
{
	printf("-");
	return;
}
void get(int x)
{
	printf("=%d",x);
	return;
}
void solve(int l,int r,vector<int>p)
{
	if (p.empty()) return;
	if (l==r)
	{
		get(p[0]);
		return;
	}
	int mid=(l+r)>>1,sl=l,sr=r;
	vector<int>A;
	vector<int>B;
	for (int i=0;i<p.size();++i)
	{
		if (dfn[p[i]]+sz[p[i]]-1<=mid) A.push_back(p[i]);
		else if (dfn[p[i]]>=mid+1) B.push_back(p[i]);
		else
		{
			while (sl<dfn[p[i]]) adder(rev[sl++]);
			while (sr>dfn[p[i]]+sz[p[i]]-1) adder(rev[sr--]);
			get(p[i]);
		}
	}
	for (int i=1;i<=sl-l+r-sr;++i) undo();
	for (int i=mid+1;i<=r;++i) adder(rev[i]);
	solve(l,mid,A);
	for (int i=mid+1;i<=r;++i) undo();
	for (int i=l;i<=mid;++i) adder(rev[i]);
	solve(mid+1,r,B);
	for (int i=l;i<=mid;++i) undo();
	return;
}
int main()
{
	int x;
	vector<int>p;
    while (scanf("%d",&n)!=EOF)
	{
		p.clear(),leng=0;
		for (int i=1;i<=n;++i) E[i].clear();
		for (int i=2;i<=n;++i) x=read(),E[x].push_back(i);
		dfs(1);
		for (int i=1;i<=n;++i) p.push_back(i);
		solve(1,n,p),puts("!");
	}
	return 0;
}