贪心算法：CodeForces-597B

C - Restaurant

 CodeForces - 597B 

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 li and the finish time ri (li ≤ ri).

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·105) — number of orders. The following nlines contain integer values li and ri each (1 ≤ li ≤ ri ≤ 109).

Output

Print the maximal number of orders that can be accepted.

Examples

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

/*
输入：区间数目n、及n个区间的起止(左闭右闭)。
输出：最多不重叠的区间有多少个。
排好序后从左到右选取右端点较小的。
*/
#include <cstdio>
#include <algorithm>
using namespace std;
struct node  //创建一个结构体代表每一个订单（活动） 
{
	int st,endd;//起止时间 
}data[500000+11];
bool cmp(node a,node b)//比较a,b活动的结束时间 
{
	return a.endd < b.endd;
}
int main()
{
	int n;
	cin>>n;
	
	for (int i = 0 ; i < n ; i++)
		cin>>data[i].st>>data[i].endd;
	sort(data,data+n,cmp);//把所有活动按照结束时间进行升序排序 
	int pos = 0;//目前最后一个活动下标 
	int ans = 1;//订单数 
	//对升序数组进行从前到后遍历，一旦出现有活动的开始时间比当前的结束时间晚，活动数+1 
	for (int i = 1 ; i < n ; i++)
	{
		if (data[i].st > data[pos].endd)
		{
			pos = i;
			ans++;
		}
	}
	cout<<ans;

	return 0;
}