#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
typedef pair<P,int> PP;

void Main() {
  int n;
  while(R n && n) {
    PP a[n];
    map<int,int> m,mm;
    rep(i,n) {
      cin >> a[i].F.F >> a[i].F.S >> a[i].S;
      if(!m.count(a[i].F.F)) {
        int s=m.size();
        m[a[i].F.F]=s;
        mm[s]=a[i].F.F;
      }
      if(!m.count(a[i].F.S)) {
        int s=m.size();
        m[a[i].F.S]=s;
        mm[s]=a[i].F.S;
      }
    }
    int N=m.size();
    int d[N][N];
    rep(i,N)rep(j,N)d[i][j]=MAX;
    rep(i,N)d[i][i]=0;
    rep(i,n) {
      d[m[a[i].F.F]][m[a[i].F.S]]=a[i].S;
      d[m[a[i].F.S]][m[a[i].F.F]]=a[i].S;
    }
    rep(k,N)rep(i,N)rep(j,N){
      if(d[i][k]!=MAX&&d[k][j]!=MAX) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    }
    int M=MAX,x;
    rep(i,N) {
      int sum=0;
      rep(j,N)if(d[i][j]!=MAX)sum+=d[i][j];
      if(sum<M) {
        M=sum;
        x=mm[i];
      } else if(sum==M) x=min(x,mm[i]);
    }
    pr(x,M);
  }
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}
