#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
#include<stack>
#include<cstdlib>
using namespace std;
struct N{
	int to,dist;
};
struct M{
	int du,num;
}di[100100];
int m;
double ans;
vector<N>p[100100];
int find(int x)
{
	if (di[x].du>0) return di[x].du;
	if (p[x].size()==1) return 0;
	int mi=0;
	for (int i=0;i<p[x].size();i++)
	mi=max(mi,find(i)+1);
	return mi;
}
int bi(M a,M b)
{
	return a.du<b.du;
}
int main()
{
	freopen("firelead.in","r",stdin);
	freopen("firelead.out","w",stdout);
	cin>>m;
	for (int i=1;i<=m;i++)
	{
		int x,y,len;
		cin>>x>>y>>len;
		p[x].push_back((N){y,len});
		p[y].push_back((N){x,len});
	}
    cout<<10.5;
    return 0;
    fclose(stdin);
    fclose(stdout);
}