#include<bits/stdc++.h>
using namespace std;
#define N 1010
vector<int>G[N];int ans=0;
void dfs(int x,int k)
{
    if(x==0)ans=max(ans,k);
    else for(int y:G[x])dfs(y,k+1);
}
int main()
{
    int n;cin>>n;
    for(int i=1,x,y,z;i<n;i++)cin>>x>>y>>z,G[x].push_back(y),G[x].push_back(z);
    dfs(1,0);
    cout<<ans;
    return 0;
}