#include <bits/stdc++.h>
#define upmin(a,b) (a)=(min((a),(b)))
#define INF (0x3f3f3f3f)
using namespace std;
const int MAXN = 5'005;
int D[MAXN], L[MAXN];
int A[MAXN];
int N;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
{
int M;
cin >> N >> M;
fill_n(A, N+2, INF);
while(M--) {
int a, b; cin >> a >> b;
if(a > b) swap(a, b);
upmin(A[b], a);
}
}
L[N+1] = N;
for(int i = N; i; i--) L[i] = min({L[i+1], A[i], i-1});
for(int i = N; i; i--) {
int r = 0;
for(int j = N+1; i < j; j--) if(i <= L[j]) {
if(1 == i && 2 != j) continue;
int t = D[j];
for(int v = N; j <= v; v--)
if(A[v] < j) t++;
if(r < t) r = t;
}
D[i] = r;
}
cout << N-1 - D[1] << '\n';
return 0;
}
