local mfl, mce = math.floor, math.ceil
local function uf_initialize(n)
  local parent = {}
  for i = 1, n do parent[i] = i end
  return parent
end

local function uf_findroot(idx, parent)
  local idx_update = idx
  while parent[idx] ~= idx do
    idx = parent[idx]
  end
  while parent[idx_update] ~= idx do
    parent[idx_update], idx_update = idx, parent[idx_update]
  end
  return idx
end

local function kruskal(n, line)
  -- line.c, line.i1, line.i2
  table.sort(line, function(a, b)
    if #a.c == #b.c then
      return a.c < b.c
    else
      return #a.c < #b.c
    end
  end
  )
  local parent = uf_initialize(n)
  local used = 0
  local last = 0
  local linenum = #line
  for i = 1, linenum do
    local c, i1, i2 = line[i].c, line[i].i1, line[i].i2
    local r1, r2 = uf_findroot(i1, parent), uf_findroot(i2, parent)
    parent[i1], parent[i2] = r1, r2
    if r1 ~= r2 then
      parent[r2] = r1
      parent[i2] = r1
      last = c
      used = used + 1
      if used == n - 1 then break end
    end
  end
  return last
end

local n = io.read("*n", "*l")
local line = {}
local z = mfl(n * (n - 1) / 2)
for i = 1, z do
  local t = {}
  local a, b, c = io.read():match("(%d+) (%d+) (%d+)")
  a = tonumber(a)
  b = tonumber(b)
  t.i1, t.i2, t.c = a, b, c
  table.insert(line, t)
end
local last = kruskal(n, line)
print(last)