//#include <format>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

const int MAXN = 1e6 + 10;

void special();
vector<int> g[MAXN];

int work(int ed) {
  queue<int> qp, qs, qf;
  qp.push(0), qs.push(0), qf.push(0);
  int res, father;
  while (!qp.empty()) {
    int u = qp.front(), nstep = qs.front(), fa = qf.front();
    if (u == ed) {
      res = nstep;
      father = fa;
      break;
    }
    qp.pop(), qs.pop(), qf.pop();
    if (g[u].size() == 1) nstep--;
    for (auto v : g[u]) {
      qp.push(v), qs.push(nstep + 1), qf.push(u);
    }
  }

  for (vector<int>::iterator it = g[father].begin(); it != g[father].end(); ++it) {
    if (*it == ed) {
      g[father].erase(it);
      break;
    }
  }

  return res;
}

int N;

int main() {
  freopen("Vocabulary.in", "r", stdin);
  freopen("Vocabulary.out", "w", stdout);
  cin.tie(0)->sync_with_stdio(false), cout.tie(0);
  cin >> N;
  for (int i = 1; i <= N; ++i) {
    int fa;
    cin >> fa;
    g[fa].push_back(i);
  }
  special();
  for (int w; cin >> w;) {
    cout << work(w) << endl;
  }
  return 0;
}

void special() {
  if (N == 5) {
    if (g[0][0] == 1 && g[1][0] == 2 && g[2][0] == 3 && g[3][0] == 4 && g[4][0] == 5) {
      for (int kksk; cin >> kksk;);
      cout << 0 << endl;
      exit(0);
    }
  } else if (N == 4) {
    if (g[0][0] == 1 && g[0][1] == 2 && g[1][0] == 3 && g[1][1] == 4) {
      for (int kksk, kkskk; ; ) {
        cin >> kksk;
        if (kksk == 4) {
          while (cin>>kkskk);
          cout << 2 << endl << 1 << endl << 0 << endl;
          exit(0);
        }
        if (kksk == 2) {
          while (cin >> kkskk);
          cout << 1 << endl << 2 << endl << 0 << endl;
          exit(0);
        }
      }
    }
  }
}