#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector <int> graf[100003];
int n,m,kontor,vizitat[100003];
void dfs (int nod) {
	vizitat[nod]=1;
	for(int i=0;i<(int)graf[nod].size();++i)
		if(vizitat[graf[nod][i]]==0)
			dfs(graf[nod][i]);
}
int main () {
	int nr1,nr2;
	freopen("dfs.in","r",stdin);
	freopen("dfs.out","w",stdout);
	scanf("%d%d", &n, &m);
	for(int i=1;i<=m;++i)
		scanf("%d%d", &nr1, &nr2),graf[nr1].push_back(nr2),graf[nr2].push_back(nr1);
	for(int i=1;i<=n;++i)
		if(vizitat[i]==0)
			++kontor,dfs(i);
	printf("%d", kontor);
	return 0;
}