# Disjoint Set Union
class DSU
  def initialize(n = 0)
    # root node: -1 * component size
    # otherwise: parent
    @parent_or_size = Array.new(n) { -1 }
  end

  def merge(a, b)
    x = leader(a)
    y = leader(b)
    return x if x == y

    x, y = y, x if -@parent_or_size[x] < -@parent_or_size[y]
    @parent_or_size[x] += @parent_or_size[y]
    @parent_or_size[y] = x
    x
  end

  def same(a, b)
    leader(a) == leader(b)
  end

  def leader(a)
    @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = leader(@parent_or_size[a]))
  end

  def size(a)
    -@parent_or_size[leader(a)]
  end

  def groups_with_leader
    h = Hash.new { |hash, key| hash[key] = [] }
    @parent_or_size.each_with_index do |parent_or_size, i|
      leader = parent_or_size < 0 ? i : parent_or_size
      h[leader] << i
    end
    h
  end

  def groups
    groups_with_leader.values
  end

  alias root leader
  alias find leader
  alias unite merge
  alias union merge
  alias same? same
end

UnionFind        = DSU
UnionFindTree    = DSU
DisjointSetUnion = DSU

n   = gets.to_s.to_i
xys = Array.new(n) { |i| gets.to_s.split.map{ |e| e.to_i } << i }.sort_by{ |(x, _, _)| x }

d = DSU.new(n)

n.times do |i|
  i.times do |j|
    if xys[i][1] > xys[j][1]
      d.merge(xys[i][2], xys[j][2])
    end
  end
end

ans = Array.new(n)
d.groups.each do |group|
  s = group.size
  group.each { |e| ans[e] = s }
end

puts ans
