
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII> > VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII> > PQPII;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

//other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int dijkstra(int from, int town_count, VVPII & nodes){
	VI dist(town_count, 10e7);
	PQPII q;
	dist[from] = 0;
	q.emplace(0, from);
	while(!q.empty()){
		PII town = q.top();
		int minute = town.first;
		int from = town.second;
		q.pop();
		if(dist[from] < minute) continue;
		for(PII node : nodes[from]){
			int to_cost = node.first;
			int to = node.second;
			
			if(to_cost + dist[from] < dist[to]){
				dist[to] = to_cost + dist[from];
				q.emplace(dist[to],  to);
			}
		}
	}
	int sum = 0;
	REP(i, town_count){
		sum +=  dist[i];
	}
	return sum;
}

int main(int argc, char const *argv[])
{
	for(int n; cin >> n, n;){
		VVPII data(10);
		int town_count = 0;
		REP(i, n){
			int from, to, minute;
			cin >> from >> to >> minute;
			town_count = max(from, max(to, town_count));
			data[from].PB(MP(minute, to));
			data[to].PB(MP(minute, from));
		}
		REP(i, town_count){
			REP(j, data[i].size()){
				PII p = data[i][j];
				int cost = p.first;
				int to = p.second;
			}
		}
		town_count++;
		// dump(town_count);
		int ans = 10e8;
		int town_number;
		REP(i, town_count){
			int temp = dijkstra(i, town_count, data);
			if(ans > temp){
				ans = temp;
				town_number = i;
			}
		}
		cout << town_number << " " << ans << endl;
	}

	return 0;
}