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

ifstream cin("dfs.in");
ofstream cout("dfs.out");

int n, m;
vector<vector<int>> adiacenta(n+1);
vector<int> vizitat(n+1);

void dfs(int k) {
	vizitat[k] = 1;
	for(int i = 1;i<=n;i++) {
		if(vizitat[i] == 0) {
			dfs(i);
		}
	}
}

int x, y;

int main() {

	cin >> n >> m;

	for(int i = 1;i<=m;i++) {
		cin >> x >> y;
		adiacenta[x].push_back(y);
		adiacenta[y].push_back(x);
	}

	int rez = 0;
	for(int i = 1;i<=m;i++) {
		if(vizitat[i] == 0) {
			rez++;
			dfs(i);
		}
	}
	cout << rez << endl;
}