import heapq



class UnionFind():

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n



    def find(self, x):

        if self.parents[x] < 0:

            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 self.parents[x] > self.parents[y]:

            x, y = y, x



        self.parents[x] += self.parents[y]

        self.parents[y] = x



    def size(self, x):

        return -self.parents[self.find(x)]



    def same(self, x, y):

        return self.find(x) == self.find(y)



    def members(self, x):

        root = self.find(x)

        return [i for i in range(self.n) if self.find(i) == root]



    def roots(self):

        return [i for i, x in enumerate(self.parents) if x < 0]



    def group_count(self):

        return len(self.roots())



    def all_group_members(self):

        return {r: self.members(r) for r in self.roots()}



    def __str__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())



n = int(eval(input()))

xy = [list(map(int, input().split())) + [i] for i in range(n)]

xy.sort()

UF = UnionFind(n)

lst = [[xy[0][1], xy[0][2]]]



for _, y, i in xy[1:]:

    flg = False

    tmp = lst[0]

    while lst and lst[0][0] < y:

        flg = True

        pos = lst[0][1]

        UF.union(i, pos)

        heapq.heappop(lst)

    if flg:

        heapq.heappush(lst, tmp)

    else:

        heapq.heappush(lst, [y, i])

for i in range(n):

    print((UF.size(i)))



    

    
import heapq

import sys

input = sys.stdin.readline



class UnionFind():

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n



    def find(self, x):

        if self.parents[x] < 0:

            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 self.parents[x] > self.parents[y]:

            x, y = y, x



        self.parents[x] += self.parents[y]

        self.parents[y] = x



    def size(self, x):

        return -self.parents[self.find(x)]



    def same(self, x, y):

        return self.find(x) == self.find(y)



    def members(self, x):

        root = self.find(x)

        return [i for i in range(self.n) if self.find(i) == root]



    def roots(self):

        return [i for i, x in enumerate(self.parents) if x < 0]



    def group_count(self):

        return len(self.roots())



    def all_group_members(self):

        return {r: self.members(r) for r in self.roots()}



    def __str__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())



def main():

    n = int(eval(input()))

    xy = [list(map(int, input().split())) + [i] for i in range(n)]

    xy.sort()

    UF = UnionFind(n)

    lst = [[xy[0][1], xy[0][2]]]

    

    for _, y, i in xy[1:]:

        flg = False

        tmp = lst[0]

        while lst and lst[0][0] < y:

            flg = True

            pos = lst[0][1]

            UF.union(i, pos)

            heapq.heappop(lst)

        if flg:

            heapq.heappush(lst, tmp)

        else:

            heapq.heappush(lst, [y, i])

    for i in range(n):

        print((UF.size(i)))

    

main()
import heapq


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            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 self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

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

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())


n = int(eval(input()))
xy = [list(map(int, input().split())) + [i] for i in range(n)]
xy.sort()
UF = UnionFind(n)
lst = [[xy[0][1], xy[0][2]]]
for _, y, i in xy[1:]:
    flg = False
    tmp = lst[0]
    while lst and lst[0][0] < y:
        flg = True
        pos = lst[0][1]
        UF.union(i, pos)
        heapq.heappop(lst)
    if flg:
        heapq.heappush(lst, tmp)
    else:
        heapq.heappush(lst, [y, i])
for i in range(n):
    print((UF.size(i)))

import heapq
import sys

input = sys.stdin.readline


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            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 self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

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

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())


def main():
    n = int(eval(input()))
    xy = [list(map(int, input().split())) + [i] for i in range(n)]
    xy.sort()
    UF = UnionFind(n)
    lst = [[xy[0][1], xy[0][2]]]
    for _, y, i in xy[1:]:
        flg = False
        tmp = lst[0]
        while lst and lst[0][0] < y:
            flg = True
            pos = lst[0][1]
            UF.union(i, pos)
            heapq.heappop(lst)
        if flg:
            heapq.heappush(lst, tmp)
        else:
            heapq.heappush(lst, [y, i])
    for i in range(n):
        print((UF.size(i)))


main()

+import sys + +input = sys.stdin.readline -n = int(eval(input())) -xy = [list(map(int, input().split())) + [i] for i in range(n)] -xy.sort() -UF = UnionFind(n) -lst = [[xy[0][1], xy[0][2]]] -for _, y, i in xy[1:]: -    flg = False -    tmp = lst[0] -    while lst and lst[0][0] < y: -        flg = True -        pos = lst[0][1] -        UF.union(i, pos) -        heapq.heappop(lst) -    if flg: -        heapq.heappush(lst, tmp) -    else: -        heapq.heappush(lst, [y, i]) -for i in range(n): -    print((UF.size(i))) +def main(): +    n = int(eval(input())) +    xy = [list(map(int, input().split())) + [i] for i in range(n)] +    xy.sort() +    UF = UnionFind(n) +    lst = [[xy[0][1], xy[0][2]]] +    for _, y, i in xy[1:]: +        flg = False +        tmp = lst[0] +        while lst and lst[0][0] < y: +            flg = True +            pos = lst[0][1] +            UF.union(i, pos) +            heapq.heappop(lst) +        if flg: +            heapq.heappush(lst, tmp) +        else: +            heapq.heappush(lst, [y, i]) +    for i in range(n): +        print((UF.size(i))) + + +main()