#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int NMAX=100004;
vector <int> L[NMAX];
bool viz[NMAX];
int n;

void citire()
{
	ifstream fin("dfs.in");
	int m;
	fin>>n>>m;
	while (m--)
	{ int x,y;
		fin>>x>>y;
		L[x].push_back(y); 
		L[y].push_back(x);
	}
	fin.close();
}

void dfs(int x)
{
	queue<int> Q;
	Q.push(x); viz[x]=1;
	while (!Q.empty())
	{
		x=Q.front(); Q.pop();
		for (int i=0;i<L[x].size();++i)
		 if (!viz[L[x][i]])
			{
				Q.push(L[x][i]); viz[L[x][i]]=1;
			}
	}	
}

int main()
{
	citire();
	memset(viz,0,sizeof(viz));
	int comp=0;
	for (int i=1;i<=n;++i)
		if (!viz[i]) { ++comp; dfs(i); }
	
	ofstream fout("dfs.out");
	fout<<comp<<"\n";
	fout.close();
	return 0;
}