#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    while(cin >> n, n){
        auto v = make_v(10, 10, INF<int>);
        for (int i = 0; i < 10; ++i) {
            v[i][i] = 0;
        }
        int mx = 0;
        for (int i = 0; i < n; ++i) {
            int a, b, c;
            scanf("%d %d %d", &a, &b, &c);
            chmin(v[a][b], c);
            chmin(v[b][a], c);
            chmax(mx, max(a, b)+1);
        }
        for (int k = 0; k < mx; ++k) {
            for (int i = 0; i < mx; ++i) {
                for (int j = 0; j < mx; ++j) {
                    chmin(v[i][j], v[i][k]+v[k][j]);
                }
            }
        }
        vector<int> s(mx, 0);
        for (int i = 0; i < mx; ++i) {
            for (int j = 0; j < mx; ++j) {
                s[i] += v[i][j];
            }
        }
        auto a = min_element(s.begin(),s.end());
        printf("%ld %d\n", a-s.begin(), *a);
    }

    return 0;
}
