#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 1000000007;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}

struct UnionFind {
    vector<int> par,siz,edge;
    UnionFind(int sz) : par(sz),siz(sz,1),edge(sz) {
        for(int i = 0; i < sz; i++) par[i] = i;
    }
    int root(int x) {
        while(par[x] != x) {
            x = par[x];
        }
        return x;
    }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if(x == y) {
            edge[x]++;
            return false;
        }
        if(siz[x] < siz[y]) swap(x,y);
        siz[x] += siz[y];
        edge[x] += edge[y]+1;
        par[y] = x;
        return true;
    }
    bool same(int x, int y) {return root(x) == root(y);}
    int size(int x) {return siz[root(x)];}
    int cal_edge(int x) {return edge[root(x)];}
};

int main() {
    int N; cin >> N;
    UnionFind UT(N);
    REP(i,N*(N-1)/2) {
        int a,b; cin >> a >> b;
        a--,b--;
        ll c; cin >> c;
        if(UT.merge(a,b)) {
            if(UT.size(a) == N) {
                cout << c << endl;
            } 
        }
    }
    return 0;
}