class UnionFind:
    def __init__(self, n):
        self.par = [-1]*n
        self.rank = [0]*n

    def Find(self, x):
        if self.par[x] < 0:
            return x
        else:
            self.par[x] = self.Find(self.par[x])
            return self.par[x]

    def Unite(self, x, y):
        x = self.Find(x)
        y = self.Find(y)

        if x != y:
            if self.rank[x] < self.rank[y]:
                self.par[y] += self.par[x]
                self.par[x] = y
            else:
                self.par[x] += self.par[y]
                self.par[y] = x
                if self.rank[x] == self.rank[y]:
                    self.rank[x] += 1

    def Same(self, x, y):
        return self.Find(x) == self.Find(y)

    def Size(self, x):
        return -self.par[self.Find(x)]

n = int(input())
ABC = []
for i in range(n*(n-1)//2):
    a, b, c = map(int, input().split())
    a, b = a-1, b-1
    ABC.append((a, b, c))
ABC.sort(key=lambda x: x[2])
ans = 0
uf = UnionFind(n)
for a, b, c in ABC:
    if uf.Same(a, b):
        continue
    uf.Unite(a, b)
    ans = max(ans, c)
print(ans)