#include<stdio.h>
/*int f(int a[], int s, int i){
int low = 0;
int high = s - 1;
int mid;
while (low <= high) {
mid = (low + high) / 2;
if (a[mid] == i) { return mid; }
else if (i > a[mid]) { low = mid + 1; }
else if (i < a[mid]){ high = mid - 1; }
}
return -1;
}
int main() {
int n = 0;
int num1[1000] = { 0 };
int num2[1000] = { 0 };
int m = 0;
scanf(" %d", &n);
for (int i = 0; i < n; i++)
scanf(" %d", &num1[i]);
scanf(" %d", &m);
for (int i = 0; i < m; i++)
scanf(" %d", &num2[i]);
for (int i = 0; i < m; i++) {
int t = f(num1, n, num2[i]);
if (t > -1) { printf("%d " ,t+1); }
else { printf("%d " , t); }
}
}
int main()
{
int n,num=0;
scanf("%d", &n);
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
for(int k=0; k<n; k++)
if(i<=j && j<=k && i+j>k && i+j+k ==n)
num++;
printf("%d", num);
}*/
int main()
{
int a[1000][2] = {};
int n,m,s=0,d=0;
scanf("%d %d",&n,&m);
for(int i=0; i<m; i++)
{
scanf("%d %d", &a[i][0], &a[i][1]);
}
for(int i=0; i<m; i++)
{
if(a[i][0] == a[i+1][0]) s++;
}
}