#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

#define int ll

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = 1e15;

struct UnionFind {
    vi r;

    UnionFind(int n) {
        r = vi(n, -1);
    }

    int root(int x) {
        if(r[x] < 0) return x;
        return r[x] = root(r[x]);
    }

    void unite(int x, int y) {
        x = root(x);
        y = root(y);
        if(x == y) return;
        if(r[x] > r[y]) swap(x, y);
        r[x] += r[y];
        r[y] = x;
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }
};

struct edge {
    int from;
    int to;
    int cost;

    bool operator<(edge &x) {
        return cost < x.cost;
    }
};

void solve() {
    int n;
    cin >> n;
    int m = n * (n - 1) / 2;
    vector<edge> g(m);
    UnionFind UF(n);
    FOR(m) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        g[i] = {a, b, c};
    }
    sort(all(g));
    int ans = 0;
    for(auto e : g) {
        if(!UF.issame(e.from, e.to)) {
            ans = e.cost;
            UF.unite(e.from, e.to);
        }
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}