//gm  --- akezhon
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NET r < tl || tr < l
#define double long double
using namespace std;
const int N=1e5+7;
const int M=1e9+7;
const int inf=1e9;
vector <int> g[N];
vector <pii> query[N];
int up[N][20];
int ans[N];
int d[N];
int sz[N];
int n, q;
void calc(int v, int f){
	d[v] = f;
	sz[v] = 1;
	for(int u : g[v]){
		calc(u, f+1);
		sz[v] += sz[u];	
	}
}
int cnt[N];
void lol(int v, int f){
	cnt[d[v]] += f;
	for(int u : g[v])lol(u, f);
}
void dfs(int v, bool cl){
	int mx=0;
	for(int u : g[v])if(sz[mx] < sz[u])mx = u;
	for(int u : g[v])if(mx != u)dfs(u, 1);
	if(mx)dfs(mx, 0);
	for(int u : g[v])if(mx != u)lol(u, 1);
	cnt[d[v]] ++;
	for(auto [x, y] : query[v])ans[y] = cnt[d[x]]-1;
	if(cl)lol(v, -1);
}
void AlemAmenov(){
	
	cin >> n;
	for(int i=1; i <= n; i++){
		cin >> up[i][0];
		if(up[i][0])g[up[i][0]].pb(i);
	}
	for(int i=1; i <= 19; i++){
		for(int j=1; j <= n; j++)up[j][i] = up[up[j][i-1]][i-1];
	}
	cin >> q;
	for(int i=1; i <= q; i++){
		int v, p, x;
		cin >> v >> p;
		x=v;
		for(int i=0; i <= 19; i++)if((1<<i) & p) v = up[v][i];
		if(v == 0){
			ans[i] = 0;
		}
		else {
			query[v].pb({x, i});
		}
	}
	for(int i=1; i <= n; i++){
		if(!d[i]){
			calc(i, 1);
			dfs(i, 1);
		}
	}
	for(int i=1; i <= q; i++){
		cout << ans[i] << ' ';
	}
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
//	freopen("justforfood.in", "r", stdin);
//	freopen("justforfood.out", "w", stdout);
	int RealName=1;
//	cin >> RealName;
//	int C=0;
	while(RealName--){
//		cout << "Case " << ++C << ":\n";
		AlemAmenov();
	}

return 0;
}