E

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 n lines 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

（用cmp能A ，用快排A不了）

#include <iostream>
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
struct node
{
    int n,m;
};
node s[500010];
bool cmp(node x,node y)
{
    return x.m<y.m;
}
int main()
{
    int i,g=1,j;
    int a;
    cin >> a;
    for(i=1; i<=a; i++)
    {
        cin >> s[i].n >> s[i].m;
    }
    sort(s+1,s+a+1,cmp);
    j=s[1].m;
    for(i=2; i<=a;i++)
    {
        if(s[i].n>j)
        {
            g++;
            j=s[i].m;
        }
    }
    cout << g;
    return 0;
}