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

#define MAXN 100002

using namespace std;

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

int n, m, V[MAXN], count;
vector <int> G[MAXN]; 

void citire () {
	fin >> n >> m;
	for (int i = 0; i < m; ++i) {
		int x, y;
		fin >> x >> y;
		G[x].push_back(y);
		G[y].push_back(x);
	}
}

void DFS (int nod) {
	V[nod]++;
	int size = G[nod].size();
	for (int i = 0; i < size; ++i) {
		if (V[G[nod][i]] == 0)
			DFS(G[nod][i]);
	}
}

int main () {
	citire();
	for (int i = 1; i <= n; ++i) {
		if (V[i] == 0) {
			DFS(i);
			count++;
		}
	}
	fout << count;
}