#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 const int maxn=+;

 const int mod=1e9+;

 int n;

 int p[maxn];

 int c[maxn],w[maxn],f[maxn];

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d",&n))

     {

         for(int i=;i<n;i++)  p[i]=i;

         int ans=n;

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

         {

             scanf("%d%d%d",&c[i],&w[i],&f[i]);

             if(ans!=n)   continue;

             if(f[i]==-)  continue;

             p[i]=f[i];

             int x=i;

             while(true)

             {

                 x=p[x];

                 w[x]+=w[i];

                 if(w[x]>c[x])  {ans=i;break;}

                 if(x==p[x])  break;

             }

         }

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

     }

     return ;

 }