#include <stdio.h>
#include <iostream>
#include <vector>

using namespace std;
using u32 = unsigned;
#define int u32
constexpr u32 N = 100009;

#define lc ((i) << 1 | 1)
#define rc ((i) + 1 << 1)

inline char nc()
{
	static char buf[99999],*l,*r;
	return l==r&&(r=(l=buf)+fread(buf,1,99999,stdin),l==r)?EOF:*l++;
}
inline char read(int&x)
{
	char c=nc();for(;(c^EOF)&&(c<'0'||'9'<c);c=nc());
	for(x=0;'0'<=c&&c<='9';x=(x<<3)+(x<<1)+(c^48),c=nc());return c;
}
inline void pc(char x)
{
	static char buf[99999],*r=buf;
	(!x||(*r++=x,r==buf+99999))&&(fwrite(buf,1,r-buf,stdout),r=buf);
}
inline void pr(int x){if(x>9)pr(x/10);pc(x%10+'0');}
int n,h[N],nxt[N],dfn[N],mmp[N],sz[N],now;
struct node
{
	int l,r,i;
	inline bool operator<(const node&kkk)const{return l>kkk.l;}
};vector<node>a[N<<2];
inline int dfs(int i)
{
	mmp[now]=i;dfn[i]=now++;sz[i]=1;
	for(int j=h[i];j;j=nxt[j])sz[i]+=dfs(j);
	return sz[i];
}
inline void add(int i,int l,int r,int ql,int qr,int x)
{
	int mid=l+r>>1;
	if(l^r)if(qr<=mid){add(lc,l,mid,ql,qr,x);return;}
	if(mid<ql){add(rc,mid+1,r,ql,qr,x);return;}
	a[i].emplace_back((node){ql,qr,x});
}
inline void o(int i){pc('+');pr(mmp[i]+1);}
inline void work(int i,int l,int r)
{
	int cnt=0;
	for(int j=0,ll=l,rr=r;j<a[i].size();++j)
	{
		for(;ll<a[i][j].l;o(ll++),++cnt);
		for(int k=a[i][j].r+1;k<=rr;o(k++),++cnt);rr=a[i][j].r;
		pc('=');pr(a[i][j].i+1);
	}
	for(;cnt--;pc('-'));
	if(l==r)return;
	int mid=l+r>>1;
	for(int j=l;j<=mid;o(j++));
	work(rc,mid+1,r);
	for(int j=mid-l+1;j--;pc('-'));
	for(int j=mid+1;j<=r;o(j++));
	work(lc,l,mid);
	for(int j=r-mid;j--;pc('-'));
}
main()
{
	if(read(n)==EOF)return pc(0),0;
	for(int i=0;i<n;h[i++]=0);for(int i=0;i<N<<2;a[i++].clear());
	for(int i=1,f;i<n;++i)read(f),--f,nxt[i]=h[f],h[f]=i;
	now=0;dfs(0);
	for(int i=0;i<n;++i)add(0,0,n-1,dfn[i],dfn[i]+sz[i]-1,i);
	work(0,0,n-1);pc('!');pc('\n');
	main();
}