#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    int n, m;
    scanf("%d%d", &n, &m);
    map<int, vector<int>> z;
    for (int i = 0; i < m; i++) {
        int l, r;
        scanf("%d%d", &l, &r); l--; r--;
        z[r].push_back(l);
    }
    int ans = 0;
    int las = -1;
    auto it = z.begin();
    for (; it != z.end(); ++it) {
        int r = it->first;
        int bad = 0;
        vector<int>& v = it->second;
        for (int j = 0; j < (int)v.size(); j++) {
            if (v[j] > las) {
                bad = 1;
            }
        }
        if (bad) {
            ans++;
            las = r;
        }
    }
    printf("%d\n", n - ans);

    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}