#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

struct edge{
    int from, to;
    string cost;
};

bool comp(edge e1, edge e2){
    if(e1.cost.size() == e2.cost.size()) return e1.cost < e2.cost;
    return e1.cost.size() < e2.cost.size(); 
}

struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) {}
    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
        if (data[y] < data[x]) swap(x, y);
        data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    int m = (n*(n-1))/2;
    vector<edge> edges(m);
    for(int i = 0; i < m; i++) {
        int a, b; string c;
        cin >> a >> b >> c;
        a--; b--;
        edges[i] = edge{a, b, c};
    }
    sort(edges.begin(), edges.end(), comp);
    UnionFind uf(n);
    for(edge e: edges){
        if(!uf.findSet(e.from, e.to)){
            uf.unionSet(e.from, e.to);
            if(uf.size(0) == n){
                cout << e.cost << endl;
            }
        }
    }
}