class UnionFind: n = 1 parent_or_size = [-1 for i in range(n)] def __init__(self, n0): self.n = n0 self.parent_or_size = [-1 for _ in range(n0)] def merge(self, a, b): assert 0 <= a < self.n, "0<=a 0: result2.append(result[i]) return result2 def main(): n = int(input()) uf = UnionFind(n) for _ in range(n * (n - 1) // 2): a, b, c = map(int, input().split()) a -= 1 b -= 1 if uf.same(a, b): # cは降順なので初回につなぐ continue uf.merge(a, b) if uf.size(0) == n: # 全部つながったら終わり。 exit(print(c)) if __name__ == "__main__": main()