#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair <int, int>
#define mkp make_pair
#define tup tuple <int, int, int> 
#define mkt make_tuple
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

mt19937 gen(time(0));

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 1e5 + 5;

int n, fa[N], le[N], ri[N], idf[N], DFN;
vc <int> G[N];

inline void dfs (int x) {
	le[x] = ++DFN; idf[DFN] = x;
	for (auto y : G[x]) dfs (y);
	ri[x] = DFN;
}

inline void out (int x) { putchar ('='); printf ("%d", x); }
inline void add (int x) { putchar ('+'); printf ("%d", x); }
inline void del () { putchar ('-'); }

inline void binary (int L, int R, vc <tup> a) {
	if(L == R) {
		auto [l, r, id] = a[0];
		return out (id);
	}
	int mid = L + R >> 1;
	
	vc <tup> le, ri; int cnt = 0, i = L, j = R;
	for (auto [l, r, id] : a) 
		if(l <= mid && r > mid) {
			assert (i <= l && j >= r);
			while (i < l) add (idf[i++]), ++cnt;
			while (j > r) add (idf[j--]), ++cnt;
			out (id);
		} 
		else if(r <= mid) le.pb (mkt(l, r, id));
	  	else ri.pb (mkt(l, r, id));
	while (cnt--) del ();
	
	if (le.size()) {
		rep (i, mid + 1, R) add (idf[i]); 
		binary (L, mid, le);
		rep (i, mid + 1, R) del ();
	}
	if (ri.size()) {
		rep (i, L, mid) add (idf[i]);
		binary (mid + 1, R, ri);
		rep (i, L, mid) del ();
	}
}

inline void testcase () {
	rep (i, 1, n) fa[i] = le[i] = ri[i] = 0, G[i].clear (); DFN = 0;
	
	rep (i, 2, n) G[fa[i] = read()].pb (i);
	dfs (1);
	
	vc <tup> seg;
	rep (i, 1, n) seg.pb (mkt(le[i], ri[i], i));
	sort (seg.begin (), seg.end ());
	
	binary (1, n, seg); 
	putchar ('!'); putchar (10);
}

signed main() {
	while (scanf ("%d", &n) != EOF) testcase ();
	return 0;
}