import sys
from sys import stdin
import heapq

def uf_find(n,p):

    ufl = []

    while p[n] != n:
        ufl.append(n)
        n = p[n]

    for i in ufl:
        p[i] = n

    return n


def uf_union(a,b,p,rank):

    ap = uf_find(a,p)
    bp = uf_find(b,p)

    if ap == bp:
        return True
    else:

        if rank[ap] > rank[bp]:
            p[bp] = ap
        elif rank[ap] < rank[bp]:
            p[ap] = bp
        else:
            p[bp] = ap
            rank[ap] += 1

        return False

N = int(stdin.readline())

CAB = []

for i in range(N*(N-1)//2):

    a,b,c = map(int,stdin.readline().split())
    CAB.append((c,a-1,b-1))

CAB.sort()

p = [i for i in range(N)]
rank = [0] * N
rem = N-1

for i in range(len(CAB)):

    c,a,b = CAB[i]

    if not uf_union(a,b,p,rank):
        rem -= 1

    if rem == 0:
        print (c)
        break