#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
typedef long long int ll;
using namespace std;
#define INF 1234567890
#define LIMIT 1

bool check[1005];
int n, m;
vector<vector<int>> vc;

void dfs(int here) {
	check[here] = true;
	for (auto a : vc[here]) {
		if (!check[a])
			dfs(a);
	}
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> m;
	vc.resize(n + 5);
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		vc[a].push_back(b);
		vc[b].push_back(a);
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		if (!check[i]) {
			ans++;
			dfs(i);
		}
	}
	cout << ans;
	


	return 0;
}