#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005

using namespace std;

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

vector < int > g[NMAX];
queue < int > q;

bool viz[NMAX];
int n, m, nr;

void dfs(int i){
	viz[i] = 1;
	for(auto x : g[i])
		if(!viz[x])
			dfs(x);
}

int main(){
	fin >> n >> m;
	for(int i = 0; i < m; i++){
		int x, y;
		fin >> x >> y;
		g[x].push_back(y);
		g[x].push_back(x);
	}
	fin.close();
	for(int i = 1; i <= n; i++){
		if(!viz[i]){
			nr++;
			dfs(i);
		}
	}
	fout << nr << '\n';
	fout.close();
	return 0;
}