from collections import deque

n = int(input())
edge = [[] for _ in range(n)]

for _ in range(n * (n - 1) // 2):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    edge[a].append((b, c))
    edge[b].append((a, c))

ok = 10 ** 100
ng = 0

while ok - ng > 1:
    mid = (ok + ng) // 2
    que = deque()
    que.append(0)
    visited = [0] * n
    visited[0] = 1
    while que:
        now = que.popleft()
        for i, j in edge[now]:
            if j > mid:
                continue
            if visited[i]:
                continue
            visited[i] = 1
            que.append(i)
    f = 1
    for i in range(n):
        f &= visited[i]
    if f:
        ok = mid
    else:
        ng = mid

print(ok)