#include <iostream>
#include <vector>

using namespace std;

const int N = 1919810;

int n;
int dad[N];
vector<int> tree[N];
int dep[N];
int cc[N];
int cal[N];

void dfs (int now) {
	for (auto son : tree[now]) {
		dep[son] = dep[now] + 1;
		dfs (son);
	}
}

int main () {
	
	freopen ("Vocabulary.in", "r", stdin);
	freopen ("Vocabulary.out", "w", stdout);

	cin >> n;
	int num;
	for (int i = 1; i <= n; i++) {
		cin >> num;
		dad[i] = num;
		cc[dad[i]]++;
		tree[dad[i]].push_back(i);
	}

	dfs (0);

	while (cin >> num) {
		while (true) {
			if (cc[num]) {
				cout << dep[num] + 1 << endl;
				break;
			}
			if (num == 0) {
				cout << 0 << endl;
				break;
			}
			cc[dad[num]]--;
			num = dad[num];
		}
	}
	
	return 0;
}