class UnionFind:
    def __init__(self, n):
        self._par = list(i for i in range(n))
        self._rank = list(0 for _ in range(n))
        self._count = list(1 for _ in range(n))

    def parent(self, a):
        if self._par[a] == a:
            return a
        else:
            self._par[a] = self.parent(self._par[a])
            return self._par[a]

    def size(self, a):
        return self._count[self.parent(a)]

    def merge(self, a, b):
        a = self.parent(a)
        b = self.parent(b)

        if a == b:
            return

        if self._rank[a] > self._rank[b]:
            self._par[b] = a
            self._count[a] += self._count[b]
        else:
            self._par[a] = b
            self._count[b] += self._count[a]
            if self._rank[a] == self._rank[b]:
                self._rank[b] += 1

    def same(self, a, b):
        return self.parent(a) == self.parent(b)


if __name__ == '__main__':
    n = int(input().strip())
    li = []
    for i in range(n*(n-1)//2):
        a, b, c = map(int, input().strip().split())
        a -= 1
        b -= 1
        li.append((c, a, b))

    li.sort()

    uf = UnionFind(n)

    ans = 0
    for (c, a, b) in li:
        if uf.size(0) == n:
            break

        if not uf.same(a, b):
            uf.merge(a, b)
            ans = c

    print(ans)