#include <stdio.h>

int a[1001][1001],n,m,v[1001],nr;
void DFS(int nod)
{
	int i;
	v[nod]=1;
	for (i=1;i<=n;i++) if (v[i]==0&&a[nod][i]) DFS(i);
}	
int main()
{
	int i,x,y;
	freopen("dfs.in","r",stdin);
	freopen("dfs.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		a[x][y]=a[y][x]=1;
	}
	for (i=1;i<=n;i++) if (v[i]==0) 
	{
		nr++; 
		DFS(i);
	}
	printf("%d\n",nr);
	return 0;
}