1 #include<cstdio>
2 #include<iostream>
3 #include<cstring>
4 using namespace std;
5 const int N = 110;
6 int ans1,ans2,n,s;
7 int minn=10000;
8 int map[N][N];
9 int main()
10 {
11 scanf("%d",&n);
12 for(int i=1;i<=101;++i)
13 for(int j=1;j<=101;++j)
14 if(i!=j)map[i][j]=minn;
15 int a,b,c;
16 while(cin>>a>>b>>c)
17 {
18 map[a][b]=c;
19 map[b][a]=c;
20 }
21 for(int k=1;k<=n;++k)
22 for(int i=1;i<=n;++i)
23 for(int j=1;j<=n;++j)
24 if(map[i][j]>map[i][k]+map[k][j])
25 map[i][j]=map[i][k]+map[k][j];
26 for(int i=1;i<=n;++i)
27 {
28 for(int j=1;j<=n;++j)
29 {
30 if(i==j)continue;
31 s=0;
32 for(int k=1;k<=n;++k)
33 s=max(s,min(map[i][k],map[j][k]));
34 if(s<minn)
35 {
36 minn=s;
37 ans1=i;
38 ans2=j;
39 }
40 }
41 }
42 printf("%d %d",ans1,ans2);
43 return 0;
44 }