#include <iostream>
//#include <fstream>
#include <algorithm>

using namespace std;

struct aru
{
    int k,v;

};
aru y[1000001];
int has (aru a, aru b)
{
    if(a.k<b.k) return 1;
    else return 0;
}

//ifstream cin("aru.in");
//ofstream cout("aru.out");
long long n,m,i,x[1000002],a,b,db,db2;

int main()
{
    cin>>n>>m;
    for(i=1;i<=m;++i)
    {
        cin>>a>>b;

        x[a]++;
        x[b]--;

    }
    //sort(y+1,y+m+1,has);
    for(i=1;i<=n;++i)
    {
        x[i]+=x[i-1];

    }
//for(i=1;i<=n;++i)cout<<x[i];
x[n+1]=5;
    for(i=1;i<=n+1;++i)
    {
        if(x[i]==0)db++;
        else if( x[i-1]==0&&db>=1)
        {
            db2++;
            db=0;
        }

    }
    cout<<db2;
    return 0;
}