/*
 纵坐标按照升序排序
 仅需考虑横坐标
*/
import java.util.*;
import java.io.*;

public class Main {
    static final int N = 32010;  // 坐标范围
    static int[] tr = new int[N];
    static int[] ans = new int[N];
    static int n;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        n = Integer.valueOf(br.readLine());
        for(int i = 0; i < n; i++) {
            String[] s = br.readLine().split(" ");
            int x = Integer.valueOf(s[0]);
            int y = Integer.valueOf(s[1]);
            // 因为 x 从 0 开始
            // 但是树状数组下标从 1 开始
            // 下标整体向右平移一个单位
            x++;
            ans[query(x)]++;
            add(x);
        }

        for(int i = 0; i < n; i++) {
            bw.write(ans[i] + "\n");
        }

        br.close();
        bw.flush();
        bw.close();
    }

    public static int lowbit(int x) {
        return x & (-x);
    }

    // 不会有星星重叠
    // 横坐标最大值，而不是个数
    public static void add(int x) {
        for(int i = x; i < N; i += lowbit(i)) {
            tr[i]++;
        }
    }

    public static int query(int x) {
        int res = 0;
        for(int i = x; i > 0; i -= lowbit(i)) {
            res += tr[i]; 
        }
        return res;
    }
}