from heapq import heapify, heappop, heappush

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]
    def find(self, x):
        """
        x が属するグループを探索して親を出す。
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]
    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]
    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)
    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]


def main():
    N = int(input())
    G = [[-1]*N for _ in range(N)]
    for i in range(N):
        G[i][i] = 0
    M = N*(N-1)//2
    PQ = []
    for i in range(M):
        a,b,c = map(int,input().split())
        a -= 1; b -= 1
        G[a][b] = c
        G[b][a] = c
        heappush(PQ,(c,a,b))
    uf = UnionFind(N)
    ans = 0
    while PQ:
        cost,a,b = heappop(PQ)
        if uf.is_same(a,b): continue
        uf.union(a,b)
        ans = max(ans, cost)
    print(ans)
    
if __name__ == '__main__':
    main()