N = int(input())
abc = [list(map(int,input().split( ))) for _ in range(N*(N-1)//2)]
class unionfind:
    """
    0-index
    数字でやるときはこっちがいいっぽい。
    """
    def __init__(self,n):
        self.n = n
        self.parents = [i for i in range(n)]
    
    def find(self,x):
        if x == self.parents[x]:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return 
        if y < x:
            x,y = y,x
        self.parents[y] = x

    def same(self,x,y):
        return self.find(x) == self.find(y)
    
u = unionfind(N)

for i in range(N*(N-1)//2):
    a,b,c = abc[i]
    u.union(a-1,b-1)
    p = True
    for j in range(N):
        for k in range(j+1,N):
            if u.same(j,k):
                continue
            p = False
            break
        if not p:
            break
    if p:
        print(c)
        exit()