You are given n segments on a coordinate line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each other or even coincide.

Your task is the following: for every k ∈ [1..n], calculate the number of points with integer coordinates such that the number of segments that cover these points equals k. A segment with endpoints l_i and r_i covers point x if and only if l_i ≤ x ≤ r_i.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of segments.

The next n lines contain segments. The i-th line contains a pair of integers l_i, r_i (0 ≤ l_i ≤ r_i ≤ 10^{18}) — the endpoints of the i-th segment.

Output

Print n space separated integers cnt_1, cnt_2, ..., cnt_n, where cnt_i is equal to the number of points such that the number of segments that cover these points equals to i.

Examples

Input

3
0 3
1 3
3 8


Output

6 2 1 


Input

3
1 3
2 4
5 7


Output

5 2 0 

Note

The picture describing the first example:

<image>

Points with coordinates [0, 4, 5, 6, 7, 8] are covered by one segment, points [1, 2] are covered by two segments and point [3] is covered by three segments.

The picture describing the second example:

<image>

Points [1, 4, 5, 6, 7] are covered by one segment, points [2, 3] are covered by two segments and there are no points covered by three segments.

// Problem: C. Covered Points Count
// Contest: Codeforces - Educational Codeforces Round 46 (Rated for Div. 2)
// URL: https://codeforces.com/contest/1000/problem/C
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

import java.io.*;
import java.util.*;

public class Main {
    private static PrintWriter pw = new PrintWriter(System.out);
    private static InputReader sc = new InputReader();

    static class InputReader{
        private static BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        private static StringTokenizer tk;

        private void next()throws IOException{
            while(tk == null || !tk.hasMoreTokens())   
                tk = new StringTokenizer(r.readLine());
        }

        private int nextInt()throws IOException{
            next();
            return Integer.parseInt(tk.nextToken());
        }

        private long nextLong()throws IOException{
            next();
            return Long.parseLong(tk.nextToken());
        }
    }

    public static void main(String args[])throws IOException{
        int t = 1;
        while(t-->0)    solve();
        pw.flush();
        pw.close();
    }
    
    private static void sort(long arr[]){
    	if(arr.length <= 1)	return;
    	
    	int size1 = arr.length/2;
    	long arr1[] = Arrays.copyOfRange(arr, 0, size1), arr2[] = Arrays.copyOfRange(arr, size1, arr.length);
    	
    	sort(arr1);
    	sort(arr2);
    	
    	int i = 0, j = 0, k = 0;
    	
    	while(i < arr1.length && j < arr2.length){
    		if(arr1[i] < arr2[j])
    			arr[k++] = arr1[i++];
    		else
    			arr[k++] = arr2[j++];
    	}
    	
    	while(i < arr1.length)
    		arr[k++] = arr1[i++];
    		
    	while(j < arr2.length)
    		arr[k++] = arr2[j++];
    }
    
    private static HashMap<Long, Integer> map;
    
    private static void increase(long c){
    	int prev = map.getOrDefault(c, 0);
    	map.put(c, prev + 1);
    }
    
    private static void decrease(long c){
    	int prev = map.getOrDefault(c, 0);
    	map.put(c, prev - 1);
    }

    private static void solve()throws IOException{
		int n = sc.nextInt();
		long ans[] = new long[n + 1];
		map = new HashMap<>();
		
		for(int i = 0; i < n; i++){
			long l = sc.nextLong(), r = sc.nextLong();
			increase(l);
			decrease(r + 1);
		}
		
		long points[] = new long[map.size()];
		int index = 0, cnt = 0;
		
		for(Long point: map.keySet())
			points[index++] = point;
			
		sort(points);
		
		// System.out.println(map);
		
		for(int i = 0; i < index; i++){
			if(i > 0)
				ans[cnt] += points[i] - points[i - 1] - 1;
			cnt += map.get(points[i]);
			ans[cnt]++;
		}
		
		for(int i = 1; i <= n; i++)
			pw.print(+ans[i]+" ");
		pw.println();
    }
}