#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream in("dfs.in");
ofstream out("dfs.out");

const int nl=100005;
bool nv[nl];
int n,m,suba=0;

vector <int> muchii[nl];

void DFS(int nod)
{
	nv[nod]=true;
	for(unsigned int i= 0; i<muchii[nod].size(); i++)
	{
		int vecin = muchii[nod][i];
		if(!nv[vecin])
			DFS(vecin);
	}
}

void citire()
{
	in>>n>>m;
	for(int i=1; i<=m;i++)
	{
		int x ,y;
		in>>x>>y;
		muchii[x].push_back(y);
		muchii[y].push_back(x);
	}
	for(int i=1; i<=n; i++)
	{
		if(!nv[i])
		{
			suba+=1;
			DFS(i);
		}
	}
}

int main() 
{	

	citire();
	out<<suba;
	return 0;
}