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.*;
import java.util.*;
import java.util.Map.Entry;

 
 
public class  gym{
	static class point implements Comparable<point>{
		long idx;
		int event;//0 -> start , 1 -> end
		point(long i,int e){idx=i;event=e;}
		@Override
		public int compareTo(point o) {
			if(idx==o.idx)return event-o.event;
			return Long.compare(idx, o.idx);
		}
		public String toString() {return idx+" "+event;}
	}
	public static void main(String[] args) throws Exception{
		MScanner sc=new MScanner(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int n=sc.nextInt();
		point[]in=new point[2*n];
		for(int i=0;i<2*n;i+=2) {
			in[i]=new point(sc.nextLong(), 0);
			in[i+1]=new point(sc.nextLong(), 1);
		}
		Arrays.sort(in);
		int occ=0;
		long[]cnt=new long[n+1];
		int i=0;
		while(i<2*n-1) {
			//System.out.println(in[i]);
			if(in[i].event==0) {
				long cur=in[i].idx;
				while(i<2*n-1 && in[i].idx==cur && in[i].event==0) {
					occ++;i++;
				}
				if(in[i].event==0) {
					cnt[occ]+=in[i].idx-cur;
				}
				else {
					cnt[occ]+=in[i].idx-cur+1;
				}
			}
			else {
				long cur=in[i].idx;
				while(i<2*n-1 && in[i].idx==cur && in[i].event==1) {
					occ--;i++;
				}
				cur++;
				if(in[i].event==0) {
					cnt[occ]+=in[i].idx-cur;
				}
				else {
					cnt[occ]+=in[i].idx-cur+1;
				}
			}
		}
		for(int o=1;o<=n;o++)pw.print(cnt[o]+" ");
		pw.flush();
	}
	static class MScanner {
		StringTokenizer st;
		BufferedReader br;
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int[] takearr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public long[] takearrl(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public Integer[] takearrobj(int n) throws IOException {
	        Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public Long[] takearrlobj(int n) throws IOException {
	        Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}