class UnionFind:
    def __init__(self, size):
        self.parent = list(range(size + 1))  # Nodes are 1-based
        self.rank = [0] * (size + 1)
    
    def find(self, x):
        if self.parent[x] != x:
            self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    
    def union(self, x, y):
        x_root = self.find(x)
        y_root = self.find(y)
        if x_root == y_root:
            return False  # Already connected
        if self.rank[x_root] < self.rank[y_root]:
            self.parent[x_root] = y_root
        else:
            self.parent[y_root] = x_root
            if self.rank[x_root] == self.rank[y_root]:
                self.rank[x_root] += 1
        return True

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    edges = []
    for _ in range(N * (N - 1) // 2):
        a = int(input[idx])
        b = int(input[idx + 1])
        c = int(input[idx + 2])
        edges.append((c, a, b))
        idx += 3
    
    edges.sort()
    uf = UnionFind(N)
    max_r = 0
    count = 0
    for c, a, b in edges:
        if uf.union(a, b):
            max_r = c
            count += 1
            if count == N - 1:
                break
    
    print(max_r)

if __name__ == "__main__":
    main()