#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int g[110][110],n,p,ans=-1;
int judge(int x,int y){
int f=0;
for(int i=1;i<=n;i++)
f=max(min(g[x][i],g[y][i]),f);
return f;
}
int main(){
freopen("sh.txt","r",stdin);
int a,b,t,x,y;
scanf("%d",&n);
memset(g,-1,sizeof g);
while(scanf("%d%d%d",&a,&b,&t)==3)
g[a][b]=g[b][a]=t;
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i!=j&&i!=k&&j!=k&&g[i][k]!=-1&&g[k][j]!=-1){
if(g[i][j]>g[i][k]+g[k][j]||g[i][j]==-1){
g[i][j]=g[i][k]+g[k][j];
}
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
p=judge(i,j);
if(p<ans||ans==-1){
ans=p;
x=i;
y=j;
}
}
}
printf("%d %d\n",x,y);
return 0;
}