#include<algorithm>

 #include<iostream>

 #include<cstdlib>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 #include<stack>

 #define N 100001

 using namespace std;

 int down[N],next[N],f[N],ans[N],n;

 stack<int> s[N],num[N];

 int find(int x)

 {

   return f[x]==x?x:f[x]=find(f[x]);

 }

 void dfs(int x)

 {

     f[x]=x;

     int i;

     for (i=down[x];i!=;i=next[i])

         {

             dfs(i);

             f[find(f[i])]=find(f[x]);

         }

     while (!s[x].empty())

       {

         if (f[s[x].top()]!=s[x].top()) ans[num[x].top()]=find(f[s[x].top()]);

         s[x].pop();

         num[x].pop();

       }

 }

 int main()

 {

     freopen("lca.in","r",stdin);

     freopen("lca.out","w",stdout);

     int i,x,y,t,root;

     scanf("%d",&n);

     for (i=;i<=n;i++)

         {

             scanf("%d",&x);

             next[i]=down[x];

             down[x]=i;

             if (x==) root=i;

         }

     scanf("%d",&t);

     for (i=;i<=t;i++)

         {

             scanf("%d%d",&x,&y);

             if (x==y) ans[i]=x;

             s[x].push(y);

             s[y].push(x);

             num[x].push(i);

             num[y].push(i);

         }

     dfs(root);

     for (i=;i<=t;i++) printf("%d\n",ans[i]);

     return ;

 }