#include <bits/stdc++.h>

#include <atcoder/dsu>

#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

using namespace atcoder;

int main() {
    int n;
    scanf("%d", &n);
    int E = n * (n - 1) / 2;
    pair<string, pii> es[E];
    rep(i, E) {
        int a, b;
        string c;
        cin >> a >> b >> c;
        --a;
        --b;
        es[i] = {c, {a, b}};
    }
    auto cmp = [](const string &s1, const string &s2) {
        if (s1.size() < s2.size()) return true;
        if (s1.size() > s2.size()) return false;
        rep(i, s1.size()) {
            if (s1[i] < s2[i]) return true;
            if (s1[i] > s2[i]) return false;
        }
        return true;
    };
    sort(es, es + E,
         [&](const pair<string, pii> &p1, const pair<string, pii> &p2) {
             return cmp(p1.fi, p2.fi);
         });

    dsu uf(n);
    string ans;
    rep(i, E) {
        auto [a, b] = es[i].se;
        if (!uf.same(a, b)) {
            uf.merge(a, b);
            swap(ans, es[i].fi);
        }
    }
    cout << ans << "\n";
}