#include <fstream>
#include <vector>
#define NMAX 100010
using namespace std;

bool contor[NMAX];
int sol, z;

vector <int> lista[NMAX];
	
void vecini(int nod)
{
	contor[nod] = 1;
	
	for(int i = 0; i < lista[nod].size(); ++i)
	{
		if(!contor[lista[nod][i]])
			vecini(lista[nod][i]);
	}
	
}


int main()
{
	int n, m;
	

	
	ifstream f("dfs.in");
	ofstream g("dfs.out");
	
	f >> n;
	
	for(f >> m; m; --m)
	{
		int x, y;
		
		f >> x >> y;
		
		lista[x].push_back(y);
		lista[y].push_back(x);
	}
	
	for(int i = 1; i <= n; ++i)
	{
		
		if(contor[i])continue;
		contor[i] = 1;
		
		
		for(unsigned int j = 0; j < lista[i].size(); ++j)
		{
			z = lista[i][j];
			
			if(!contor[z])
			{
			
				vecini(z);
			}
		
			++sol;
		}
	}
	
	g << sol;
	
	f.close();
	g.close();
	
	return 0;
	
}