using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading;

// (づ°ω°)づﾐe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
    class Dsu
    {
        private readonly int[] parent;
        public int[] size;

        public Dsu(int n)
        {
            parent = Enumerable.Range(0, n).ToArray();
            size = Enumerable.Repeat(1, n).ToArray();
        }

        public int FindSet(int v)
        {
            if (v == parent[v])
                return v;
            return parent[v] = FindSet(parent[v]);
        }

        public void UnionSets(int a, int b)
        {
            a = FindSet(a);
            b = FindSet(b);
            if (a != b)
            {
                size[a] += size[b];
                parent[b] = a;
            }
        }
    }

    public void Solve()
    {
        int n = ReadInt();
        var a = new (int x, int y, int id)[n];
        for (int i = 0; i < n; i++)
            a[i] = (ReadInt(), ReadInt(), i);
        Array.Sort(a, (a1, a2) => a1.x.CompareTo(a2.x));

        var dsu = new Dsu(n);
        var stack = new Stack<int>();
        for (int i = 0; i < n; i++)
        {
            while (stack.Count > 0 && a[stack.Peek()].y > a[i].y)
                stack.Pop();
            if (stack.Count > 0)
                dsu.UnionSets(i, stack.Peek());
            stack.Push(i);
        }
        stack.Clear();
        for (int i = n - 1; i >= 0; i--)
        {
            while (stack.Count > 0 && a[stack.Peek()].y < a[i].y)
                stack.Pop();
            if (stack.Count > 0)
                dsu.UnionSets(i, stack.Peek());
            stack.Push(i);
        }

        var lmin = new int[n];
        lmin[0] = a[0].y;
        for (int i = 1; i < n; i++)
            lmin[i] = Math.Min(lmin[i - 1], a[i].y);
        var rmax = new int[n];
        rmax[n - 1] = a[n - 1].y;
        for (int i = n - 2; i >= 0; i--)
            rmax[i] = Math.Max(rmax[i + 1], a[i].y);
        for (int i = 1; i < n; i++)
        {
            int l = 0, r = i;
            while (l < r)
            {
                int mid = (l + r) / 2;
                if (lmin[mid] > a[i].y)
                    l = mid + 1;
                else
                    r = mid;
            }
            dsu.UnionSets(l, i);
        }
        for (int i = n - 2; i >= 0; i--)
        {
            int l = i, r = n - 1;
            while (l < r)
            {
                int mid = (l + r + 1) / 2;
                if (rmax[mid] < a[i].y)
                    r = mid - 1;
                else
                    l = mid;
            }
            dsu.UnionSets(l, i);
        }

        var ans = new int[n];
        for (int i = 0; i < n; i++)
            ans[a[i].id] = dsu.size[dsu.FindSet(i)];
        WriteLines(ans);
    }

    #region Main

    protected static TextReader reader;
    protected static TextWriter writer;
    static void Main()
    {
#if DEBUG
        reader = new StreamReader("..\\..\\input.txt");
        //reader = new StreamReader(Console.OpenStandardInput());
        writer = Console.Out;
        //writer = new StreamWriter("..\\..\\output.txt");
#else
        reader = new StreamReader(Console.OpenStandardInput());
        writer = new StreamWriter(Console.OpenStandardOutput());
        //reader = new StreamReader("input.txt");
        //writer = new StreamWriter("output.txt");
#endif
        try
        {
            new Solver().Solve();
            //var thread = new Thread(new Solver().Solve, 1024 * 1024 * 128);
            //thread.Start();
            //thread.Join();
        }
        catch (Exception ex)
        {
#if DEBUG
            Console.WriteLine(ex);
#else
            throw;
#endif
        }
        reader.Close();
        writer.Close();
    }

    #endregion

    #region Read / Write
    private static Queue<string> currentLineTokens = new Queue<string>();
    private static string[] ReadAndSplitLine() { return reader.ReadLine().Split(new[] { ' ', '\t', }, StringSplitOptions.RemoveEmptyEntries); }
    public static string ReadToken() { while (currentLineTokens.Count == 0) currentLineTokens = new Queue<string>(ReadAndSplitLine()); return currentLineTokens.Dequeue(); }
    public static int ReadInt() { return int.Parse(ReadToken()); }
    public static long ReadLong() { return long.Parse(ReadToken()); }
    public static double ReadDouble() { return double.Parse(ReadToken(), CultureInfo.InvariantCulture); }
    public static int[] ReadIntArray() { return ReadAndSplitLine().Select(int.Parse).ToArray(); }
    public static long[] ReadLongArray() { return ReadAndSplitLine().Select(long.Parse).ToArray(); }
    public static double[] ReadDoubleArray() { return ReadAndSplitLine().Select(s => double.Parse(s, CultureInfo.InvariantCulture)).ToArray(); }
    public static int[][] ReadIntMatrix(int numberOfRows) { int[][] matrix = new int[numberOfRows][]; for (int i = 0; i < numberOfRows; i++) matrix[i] = ReadIntArray(); return matrix; }
    public static int[][] ReadAndTransposeIntMatrix(int numberOfRows)
    {
        int[][] matrix = ReadIntMatrix(numberOfRows); int[][] ret = new int[matrix[0].Length][];
        for (int i = 0; i < ret.Length; i++) { ret[i] = new int[numberOfRows]; for (int j = 0; j < numberOfRows; j++) ret[i][j] = matrix[j][i]; }
        return ret;
    }
    public static string[] ReadLines(int quantity) { string[] lines = new string[quantity]; for (int i = 0; i < quantity; i++) lines[i] = reader.ReadLine().Trim(); return lines; }
    public static void WriteArray<T>(IEnumerable<T> array) { writer.WriteLine(string.Join(" ", array)); }
    public static void Write(params object[] array) { WriteArray(array); }
    public static void WriteLines<T>(IEnumerable<T> array) { foreach (var a in array) writer.WriteLine(a); }
    private class SDictionary<TKey, TValue> : Dictionary<TKey, TValue>
    {
        public new TValue this[TKey key]
        {
            get { return ContainsKey(key) ? base[key] : default(TValue); }
            set { base[key] = value; }
        }
    }
    private static T[] Init<T>(int size) where T : new() { var ret = new T[size]; for (int i = 0; i < size; i++) ret[i] = new T(); return ret; }
    #endregion
}

Measured memory_bytes: 29680