Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		matrix := make([][]int, 10)
		for i := range matrix {
			matrix[i] = make([]int, 10)
		}
		for i := range matrix {
			for j := range matrix[i] {
				if i == j {
					matrix[i][j] = 0
				} else {
					matrix[i][j] = INF
				}
			}
		}
		num := 0
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			from, _ := strconv.Atoi(buf[0])
			to, _ := strconv.Atoi(buf[1])
			cost, _ := strconv.Atoi(buf[2])
			if num < from {
				num = from
			}
			if num < to {
				num = to
			}
			matrix[from][to] = cost
			matrix[to][from] = cost
		}
		num++
		for i := 0; i < num; i++ {
			for j := 0; j < num; j++ {
				for k := 0; k < num; k++ {
					if matrix[j][i]+matrix[i][k] < matrix[j][k] {
						matrix[j][k] = matrix[j][i]+matrix[i][k]
					}
				}
			}
		}
		ans, sum := 0, INF
		for i := 0; i < num; i++ {
			now := 0
			for j := 0; j < num; j++ {
				now += matrix[i][j]
			}
			if sum > now {
				sum = now
				ans = i
			}
		}
		fmt.Println(ans, sum)
	}
}

C++: 
//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;
}

C++: #include<cstdio>
#include<algorithm>
#include<climits>
#include<numeric>
using namespace std;
int main()
{
	int c[10][10],n,m,i,j,k,x,y,z;
	while(scanf("%d",&m),m)
	{
		for(i=0;i<10;++i)
			for(j=0;j<10;++j)
				c[i][j]=INT_MAX/2,c[i][i]=0;
		for(n=i=0;i<m;++i)
			scanf("%d%d%d",&x,&y,&z), c[x][y]=c[y][x]=z, n=max(n,max(x,y)+1);
		for(k=0;k<n;++k)
			for(i=0;i<n;++i)
				for(j=0;j<n;++j)
					c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
		x=INT_MAX,y=INT_MAX;
		for(i=0;i<n;++i)
			if(z=accumulate(c[i],c[i]+n,0),x>z)
				x=z,y=i;
		printf("%d %d\n",y,x);
	}
	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cctype>

#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max)) 

using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VII;
typedef pair<int,int> PII;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);

	while(1){
		int n,ans_k,ans_sum = INT_MAX,m = 0;
		cin >> n;
		if(n == 0) break;
		VI a(n),b(n),c(n);
		rep(i,n){
			cin >> a[i] >> b[i] >> c[i];
			if(m < a[i] || m < b[i])
				m = a[i] > b[i]? a[i]:b[i];
		}
		VI cost(m + 1);
		priority_queue<PII,vector<PII >,greater<PII> > que;
		rep(k,cost.size()){
			int res = 0;
			fill(all(cost), INT_MAX);
			que.push(mp(0,k));
			cost[k] = 0;
			while(!que.empty()){
				int d = que.top().first, u = que.top().second;
				que.pop();
				if(cost[u] < d) continue;
				rep(i,n){
					if(u == a[i] && cost[u] + c[i] < cost[b[i]]){
						cost[b[i]] = cost[u] + c[i];
						que.push(mp(cost[b[i]], b[i]));
					}
					if(u == b[i] && cost[u] + c[i] < cost[a[i]]){
						cost[a[i]] = cost[u] + c[i];
						que.push(mp(cost[a[i]], a[i]));
					}
				}
			}
			rep(i,cost.size()){
				res += cost[i];
			}
			if(res < ans_sum){
				ans_k = k;
				ans_sum = res;
			}
		}
		cout << ans_k << " " << ans_sum << endl;
	}
	return 0;
}