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.
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class Main {
	
	static final int START_POINT = 1, END_POINT = 2,SINGLE_POINT = 3;
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
//		Scanner sc = new Scanner("out");
		int n = sc.nextInt();
		ArrayList<Dot> dots = new ArrayList<Dot>(n<<1);
		TreeSet<Long> points = new TreeSet<>();
		for (int i = 0; i < n; i++) 
		{
			long a = sc.nextLong() , b = sc.nextLong();
			if(a!=b)
			{
				dots.add(new Dot(a, START_POINT));
				dots.add(new Dot(b, END_POINT));
				points.add(a);
				points.add(b);
			}
			else
			{
				points.add(a);
				dots.add(new Dot(a, SINGLE_POINT));
			}
		}
		Collections.sort(dots);
		long[] ans = new long[n+1];
		int segments = 0;
		long cur = points.first()-1, prev = 0;
		int i = 0;
		while(!points.isEmpty())
		{
			prev = cur+1;
			cur = points.pollFirst();
			ans[segments] += 1l * (cur-prev);
			prev = cur;
			int singleCount = 0;
			int oldSegmentsCnt = segments;
			while(i<dots.size()&&dots.get(i).x<=cur)
			{
				int orient = dots.get(i).point;
				if(orient==START_POINT)
				{
					segments++;
					oldSegmentsCnt++;
				}
				else if(orient==END_POINT)
					segments--;
				else
					singleCount++;
				
				++i;
			}
//			ans[oldSegmentsCnt] += 1l * (cur-prev+1);
//			if(singleCount>0)
				ans[singleCount+oldSegmentsCnt]++;
		}
		
		StringBuilder sb = new StringBuilder();
		for (int j = 1; j < ans.length; j++) 
			sb.append(ans[j]+" ");
		
		System.out.println(sb);
		
	}
	
	
	static class Dot implements Comparable<Dot>
	{
		long x;
		int point;
		public Dot(long pos,int p) {x = pos;point = p;}
		public int compareTo(Dot o) {return Long.compare(x, o.x);}
	}
	  
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
		public Scanner(String s) throws FileNotFoundException {br = new BufferedReader(new FileReader(s));}
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		public String nextLine() throws IOException {return br.readLine();}		
		public long nextLong() throws IOException {return Long.parseLong(next());}		
		public double nextDouble() throws IOException {return Double.parseDouble(next());}	
		public char nextChar() throws IOException{return next().charAt(0);}
		public boolean ready() throws IOException {return br.ready();}
		public int[] nextIntArr() throws IOException{
			st = new StringTokenizer(br.readLine());
			int[] res = new int[st.countTokens()];
			for (int i = 0; i < res.length; i++)
				res[i] = nextInt();
			return res;
		}
		public char[] nextCharArr() throws IOException{
			st = new StringTokenizer(br.readLine());
			char[] res = new char[st.countTokens()];
			for (int i = 0; i < res.length; i++) 
				res[i] = nextChar();
			return res;
		}
	}

}