I - Restaurant 【简单贪心】

I - Restaurant

 

A restaurant received n orders for the rental. Each rental order reserve the restaurant for a continuous period of time, the i-th order is characterized by two time values — the start time l_i and the finish time r_i (l_i ≤ r_i).

Restaurant management can accept and reject orders. What is the maximal number of orders the restaurant can accept?

No two accepted orders can intersect, i.e. they can't share even a moment of time. If one order ends in the moment other starts, they can't be accepted both.

Input

The first line contains integer number n (1 ≤ n ≤ 5·10⁵) — number of orders. The following n lines contain integer values l_i and r_i each (1 ≤ l_i ≤ r_i ≤ 10⁹).

Output

Print the maximal number of orders that can be accepted.

Example

Input

2
7 11
4 7

Output

1

Input

5
1 2
2 3
3 4
4 5
5 6

Output

3

Input

6
4 8
1 5
4 7
2 5
1 3
6 8

Output

2

#include<stdio.h>
#include<algorithm>
using namespace std;
struct Fuck
{
	int sta;
	int end;
}a[500000+10];
bool cao(Fuck a,Fuck b)
{
	if(a.end == b.end )
		return a.sta > b.sta;
	else
		return a.end < b.end;
}
int main()
{
	int n;
	while( ~scanf("%d",&n) )
	{
		for(int i=0;i<n;i++)
		scanf("%d %d",&a[i].sta,&a[i].end);
		sort(a,a+n,cao);
		int t=a[0].end,sum=1; 
		for(int i=0;i<n;i++)
		{
			if(a[i].sta>t)
			{
				sum++;
				t=a[i].end;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
	
}