#include <iostream>
#include <vector>
using namespace std;

const int NMAX = 1e5;
vector<int> G[NMAX + 1];	
bool vis[NMAX + 1];

void dfs(int node) {
	vis[node] = 1;
	for (auto vecin: G[node]) {
		if(!vis[vecin]) dfs(vecin);
	}
}


int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int x,y;
		cin >> x >> y;
		G[x].push_back(y);
		G[y].push_back(x);

	}

	int cc = 0;
	for (int i = 1; i<= n; i++) {
		if(!vis[i]) {
			cc++;
			dfs(i);
		}
	}
	cout << cc;
}