#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5; 

int n, sz[N], dfn[N], num, idx[N]; 
int fa[N]; 
vector<int> G[N]; 
struct Query {
    int l, r, id; 
    Query(int l = 0, int r = 0, int id = 0) : l(l), r(r), id(id) {}
    bool operator< (const Query &a) const {
        return l < a.l; 
    }
}; 
vector<Query> Q; 

void dfs(int x, int ff) {
    sz[x] = 1; idx[dfn[x] = ++num] = x; 
    for (int y : G[x]) if (y != ff) dfs(y, x), sz[x] += sz[y]; 
    Q.emplace_back(dfn[x], dfn[x] + sz[x] - 1, x); 
} 

void solve(vector<Query> Q, int l, int r) {
    if (l == r) {
        // assert(Q.size() <= 1); 
        if (Q.size()) cout << "=" << Q[0].id; 
        return; 
    }
    int mid = l + r >> 1; 

    vector<Query> lt, rt, now; 
    for (auto it : Q)
        if (it.r < mid) lt.emplace_back(it); 
        else if (it.l > mid) rt.emplace_back(it); 
        else now.push_back(it); 

    // 当前已经加入 [1, l - 1], [r + 1, n]
    int pl = l, pr = r, cnt = 0; 
    for (auto it : now) {
        // [l, r] 
        // assert(it.l >= l); assert(it.r <= r); 
        while (pl < it.l) cout << "+" << idx[pl++], ++cnt; 
        while (pr > it.r) cout << "+" << idx[pr--], ++cnt; 
        cout << "=" << it.id; 
    }
    for (int i = 1; i <= cnt; ++i) cout << "-"; 
    // exit(0); 

    if (l <= mid - 1 && lt.size()) {
        for (int i = r; i >= mid; --i) cout << "+" << idx[i];  
        solve(lt, l, mid - 1); 
        for (int i = r; i >= mid; --i) cout << "-"; 
    }

    if (mid + 1 <= r && rt.size()) {
        for (int i = l; i <= mid; ++i) cout << "+" << idx[i]; 
        solve(rt, mid + 1, r); 
        for (int i = l; i <= mid; ++i) cout << "-"; 
    }
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    while (cin >> n) {
        num = 0; 
        for (int i = 2; i <= n; ++i) cin >> fa[i]; 
        for (int i = 1; i <= n; ++i) G[i].clear(); 
        for (int i = 2; i <= n; ++i)
            G[fa[i]].emplace_back(i), 
            G[i].emplace_back(fa[i]); 
        Q.clear(); 
        dfs(1, 0); 
        sort(Q.begin(), Q.end()); 

        // for (auto it : Q) cout << it.l << " " << it.r << " " << it.id << "\n"; 

        solve(Q, 1, n); 
        cout << "!\n"; 
    }
    return 0;
}