#include <bits/stdc++.h>

using namespace std;

const int N = 1e5;

int n;
vector<int> e[N + 5];
int fa[N + 5], siz[N + 5], id[N + 5], rk[N + 5], tot;
void dfs(int u) {
  rk[id[u] = ++tot] = u, siz[u] = 1;
  for (int v : e[u])
    dfs(v), siz[u] += siz[v];
}
void solve(int l, int r, vector<int> qry) {
  if (l == r) {
    for (int u : qry) printf("=%d", u);
    return ;
  }
  int mid = (l + r) >> 1;
  vector<int> ql, qr, vec;
  for (int u : qry)
    if (id[u] + siz[u] - 1 <= mid) ql.push_back(u);
    else if (id[u] > mid) qr.push_back(u);
    else vec.push_back(u);
  int cnt = 0, tl = l, tr = r;
  for (int u : vec) {
    while (tl < id[u]) printf("+%d", rk[tl++]), ++cnt;
    while (tr >= id[u] + siz[u]) printf("+%d", rk[tr--]), ++cnt;
    printf("=%d", u);
  }
  for (; cnt; --cnt) putchar('-');
  for (int i = mid + 1; i <= r; ++i) printf("+%d", rk[i]);
  solve(l, mid, ql);
  for (int i = mid + 1; i <= r; ++i) putchar('-');
  for (int i = l; i <= mid; ++i) printf("+%d", rk[i]);
  solve(mid + 1, r, qr);
  for (int i = l; i <= mid; ++i) putchar('-');
}

bool solve() {
  if (scanf("%d", &n) == EOF) return 0;
  for (int i = 1; i <= n; ++i) e[i].clear();
  for (int i = 2; i <= n; ++i) scanf("%d", fa + i), e[fa[i]].push_back(i);
  tot = 0, dfs(1), solve(1, n, vector<int>(rk + 1, rk + n + 1)), puts("!");
  return 1;
}

int main() {
  while (solve());
}