//Parcurgerea DFS.
//Implementarea utilizind Liste de Adiacenta.
//Meotda Recursiva.
#include <fstream>
#include <vector>
using namespace std;

int viz[100005];
int n,m;
vector <int> L[100005];

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

void Read()  
{
	//Citim Graful
	//n - Numarul de noduri, variabila globala;
	//m - Numarul de Arce Neorinetate, variabila globala;
	//L - Liste de Adiacenta, variabila globala;
	inFile >> n >> m;
	int x,y;
	for(int i=1; i<=m; i++){
		inFile >> x >> y;
		L[x].push_back(y);
		L[y].push_back(x);
	}
}

void DFS(int i)
{
	viz[i]=1;
	for(unsigned int j=0;j<L[i].size();j++){
		if( !viz[ L[i][j] ] ){
			DFS( L[i][j] );
		}
	}

	
}

int main()
{
	Read();
	int ct=0;  //Numarul de Componente Conexe Distincte;
	for(int i=1;i<=n;i++){
		if(!viz[i]){
			ct++;
			DFS(i); //Incepem "sondarea" din nodul i;
		}
	}
	outFile << ct;
	return 0;
}