#include<bits/stdc++.h>  
using namespace std;  
int sum;  
int n;  
int a[1000][1000];  
int w[10000];  
int s;  
void bdfs(int s)  
{  
    if(s > n)  
    {  
        sum = max(sum,s);  
        s = 0;  
        return;  
    }  
    for(w[s] = 0;w[s] <= 1;w[s]++)  
    {  
        if(w[s])  
        {  
            s += a[w[s]][w[s - 1]];  
        }  
        bdfs(s + 1);  
        if(w[s])  
        {  
            s -= a[w[s]][w[s - 1]];  
        }  
    }  
}  
int main()  
{  
    cin >> n;  
    for(int i = 1;i <= n;i++)   
    {  
        int aa,bb,cc;  
        cin >> aa >> bb >> cc;  
        a[aa][bb] = cc;  
        a[bb][aa] = cc;  
    }  
    bdfs(1);  
    cout << sum;  
}