#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
using namespace std;
int n,m;
struct str{
	vector<int> son;
	vector<double> l;
}a[100010];
double w[100010];
bool use[100010];
void fun(int x,double y){
	
	w[x]=min(y,w[x]);
	//cout<<x<<w[x]<<endl;	
	use[x]=1;
	for(int i=0;i<a[x].son.size();i++){
		if(use[a[x].son[i]]==0)
		{
	//	use[a[x].son[i]]=1;
		fun(a[x].son[i],a[x].l[i]+y);
	//	use[a[x].son[i]]=0;
        }
	}
	use[x]=0;
}
int main()
{
		freopen("firelead.in","r",stdin);
	freopen("firelead.out","w",stdout);
	int k1,k2;
	double k3;
	cin>>m;
	n=m+1;
	for(int i=1;i<=n;i++)
	{
		w[i]=90000000;
	}
	for(int i=1;i<=m;i++)
	{
		cin>>k1>>k2>>k3;
		a[k1].son.push_back(k2);
		a[k1].l.push_back(k3);
		a[k2].son.push_back(k1);
		a[k2].l.push_back(k3);
	}
	for(int i=1;i<=n;i++){
	//	cout<<i<<" "<<n; 
	//	cout<<a[i].son.size();
		if(a[i].son.size()==1){
	//	 use[i]=1;
		 fun(i,0);
	//	 use[i]=0;
	     }
	}
	double ans=0;
	for(int i=1;i<=n;i++)
	{
		ans=max(ans,w[i]);
	}
	printf("%.1lf",ans);
	return 0;
}