#include <stdio.h>
const long N=100000;
long *a[N], x[N], y[N], d[N], viz[N];

void dfs(int x);

int main()
{
	long i, conex=0, n, m;
	freopen("dfs.in", "r", stdin);
	freopen("dfs.out", "w", stdout);
	scanf("%ld%ld", &n, &m);
	for (i=1; i<=m; i++)
	{
		scanf("%ld%ld", &x[i], &y[i]);
		d[x[i]]++;
		d[y[i]]++;
	}//for i
	for (i=1; i<=n; i++)
	{
		a[i]=new long[d[i]+1];
		a[i][0]=0;
	}//for i
	for (i=1; i<=m; i++)
	{
		a[y[i]][++a[y[i]][0]]=x[i];
		a[x[i]][++a[x[i]][0]]=y[i];
	}//for i
	for (i=1; i<=n; i++)
		if (!viz[i])
		{
			conex++;
			dfs(i);
		}//if
	printf("%ld", conex);	
}//main

void dfs(int x)
{
	long i;
	if (!viz[x])
	{
		viz[x]=1;
		for (i=1; i<=a[x][0]; i++)
			dfs(a[x][i]);
	}//if
}//dfs