#include<cstdio>

 #include<algorithm>

 using namespace std;

 typedef long long LL;

 LL log2n=,cnt=;

 LL anc[][],maxv[][],v[];

 LL anc2[][],sum[][];

 LL pow2[]={,,,,,,,,,,,,,,,,,,,};

 //maxv[i][j]指i到其2^j级祖先的路径上点权最大值，含2^j级祖先，不含i

 //sum[i][j]指i到其2^j级祖先的路径上点权之和，含祖先，不含i

 LL Q,last;

 int main()

 {

     LL i,idx,p,q,t,ans;

     v[]=1e15+;

     for(i=;i<=log2n;i++)    maxv[][i]=maxv[][i]=sum[][i]=sum[][i]=1e15+;

     scanf("%lld",&Q);

     while(Q--)

     {

         scanf("%lld%lld%lld",&idx,&p,&q);

         p^=last;q^=last;

         //printf("%lld %lld\n",p,q);

         if(idx==)

         {

             v[++cnt]=q;anc[cnt][]=p;maxv[cnt][]=v[anc[cnt][]];

             //putchar('a');printf("%d %d ",0,maxv[cnt][0]);

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

             {

                 anc[cnt][i]=anc[anc[cnt][i-]][i-];

                 maxv[cnt][i]=max(maxv[cnt][i-],maxv[anc[cnt][i-]][i-]);

                 //printf("%d %d ",i,maxv[cnt][i]);

             }

             //putchar('b');

             for(t=cnt,i=log2n;i>=;i--)

                 if(maxv[t][i]<v[cnt])

                     t=anc[t][i];

             anc2[cnt][]=anc[t][];sum[cnt][]=v[anc2[cnt][]];

             //printf("%d %d\n",cnt,nxt[cnt]);

             //printf("%lld %lld ",0LL,sum[cnt][0]);

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

             {

                 anc2[cnt][i]=anc2[anc2[cnt][i-]][i-];

                 sum[cnt][i]=sum[cnt][i-]+sum[anc2[cnt][i-]][i-];

                 //printf("%lld %lld ",i,sum[cnt][i]);

             }

             //putchar('c');

         }

         else

         {

             q-=v[p];ans=;if(q<){ans=;goto xxx;}

             for(t=p,i=log2n;i>=;i--)

                 if(sum[t][i]<=q)

                 {

                     //t=anc2[t][i];

                     q-=sum[t][i];ans+=pow2[i];//ans++

                     t=anc2[t][i];

                 }

             xxx:last=ans;

             printf("%lld\n",ans);

         }

     }

     return ;

 }