#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,m;
int edge[1005][1005];
int vis1[1005];
int vis2[10005];
bool search_path(int u){
for(int v = 1; v <= n; v++){
if(edge[u][v] && !vis2[v]){
vis2[v] = true;
if(vis1[v] == -1 || search_path(vis1[v])){
vis1[v] = u;
vis1[u] = v;
return true;
}
}
}
return false;
}
int MaxMatch(){
int u,ans = 0;
memset(vis1,-1,sizeof(vis1));
for(int i = 1; i <= n; i++){
if(vis1[i] == -1){
memset(vis2,0,sizeof(vis2));
if(search_path(i))
ans++;
}
}
return ans;
}
int main(){
while(~scanf("%d%d",&n,&m)){
int x,y;
memset(edge,0,sizeof(edge));
for(int i = 0; i < m; i++){
scanf("%d%d",&x,&y);
edge[x][y] = edge[y][x] = 1;
}
printf("%d\n",MaxMatch());
}
return 0;
}