#include<bits/stdc++.h>
using namespace std;
const int N=2e6+100;
int n,m;
struct question{int x,y,t,id,ans1,ans2;}q[N];
bool cmp(question A,question B){return A.t<B.t;}
bool cmp_id(question A,question B){return A.id<B.id;}
int head[N],to[N],ne[N],tot;
void add(int x,int y){ 
	ne[++tot]=head[x];
	to[tot]=y;
	head[x]=tot;
}
int fa[N],top[N],si[N],son[N],id[N],rev[N],de[N],dfn;
void dfs1(int u,int f){
	de[u]=de[f]+1,fa[u]=f,si[u]=1;
	for(int i=head[u];i;i=ne[i]){
		int v=to[i];
		dfs1(v,u);
		si[u]+=si[v];
		if(si[v]>si[son[u]]) son[u]=v;
	}
}
void dfs2(int u,int tp){
	top[u]=tp,id[u]=++dfn,rev[dfn]=u;
	if(son[u]) dfs2(son[u],tp);
	for(int i=head[u];i;i=ne[i]){
		int v=to[i];
		if(v==son[u]) continue;
		dfs2(v,v);
	}
}
struct Tree{
	struct tree{int l,r,sum;}t[N];
	#define lson o<<1
	#define rson o<<1|1
	void build(int o,int l,int r){
		t[o].l=l,t[o].r=r;
		if(l==r) return void (t[o].sum=0);
		int mid=(l+r)>>1;
		build(lson,l,mid),build(rson,mid+1,r);
	}
	void update(int o,int pos,int val){
		if(t[o].l==t[o].r) return void(t[o].sum=val);
		int mid=(t[o].l+t[o].r)>>1;
		if(pos<=mid) update(lson,pos,val);
		else update(rson,pos,val);
		t[o].sum=t[lson].sum+t[rson].sum;
	}
	int query(int o,int l,int r){
		if(t[o].l==l and t[o].r==r) return t[o].sum;
		int mid=(t[o].l+t[o].r)>>1;
		if(r<=mid) return query(lson,l,r);
		else if(l>mid) return query(rson,l,r);
		else return query(lson,l,mid)+query(rson,mid+1,r);
	}
}rt;
int get_lca(int x,int y,int i){
	int res=0;
	while(top[x]!=top[y]){
		if(de[top[x]]<de[top[y]]) swap(x,y);
		if(i) res+=rt.query(1,id[top[x]],id[x]);
		x=fa[top[x]];
	}
	if(de[x]>de[y]) swap(x,y);
	if(i) res+=rt.query(1,id[x],id[y]);
	q[i].ans2=res;
	return x;
}
void work(){
	rt.build(1,1,n);
	for(int i=1;i<=m;i++){
		if(q[i].y){ //case1
			int lca=get_lca(q[i].x,q[i].y,(q[i].t<=0?0:i));
			q[i].ans1=de[q[i].x]+de[q[i].y]-2*de[lca]+1;
		}
		else rt.update(1,id[q[i].x],1);//case2
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int x;scanf("%d",&x);
		if(x) add(x,i);
	}
	dfs1(1,0),dfs2(1,1);
	cin>>m;
	for(int i=1;i<=m;i++){
		int opt;scanf("%d",&opt);
		if(opt==1){
			scanf("%d%d%d",&q[i].x,&q[i].y,&q[i].t);
			q[i].t=i-q[i].t-1;
		}
		else{
			scanf("%d",&q[i].x);
			q[i].t=i;
		}
		q[i].id=i;
	}
	sort(q+1,q+1+m,cmp);
	work();
	sort(q+1,q+1+m,cmp_id);
	for(int i=1;i<=m;i++) if(q[i].y) cout<<q[i].ans1<<' '<<q[i].ans2<<endl; 
}