#include <bits/stdc++.h> 

const int kNmax = 100005;

class Task {
 public:
	void solve() {
		read_input();
		print_output(get_result());
	}

 private:
	int n;
	int m;
	std::vector<int> adj[kNmax];

	void read_input() {
		std::ifstream fin("dfs.in");
		fin >> n >> m;
		for (int i = 1, x, y; i <= m; i++) {
			fin >> x >> y;
			adj[x].push_back(y);
			adj[y].push_back(x);
		}
		fin.close();
	}

	int get_result() {
        int solution = 0;
        std::vector<bool> visited(n + 1, false);
        for (int i = 1; i <= n ; i++) {
            if (!visited[i]) {
                dfsHelper(i, visited);
                solution++;
            }
        }
        return solution;
	}


	void dfsHelper(int node, std::vector<bool> &visited) { 
        visited[node] = true;
        for (auto& adj : adj[node]) {
            if (!visited[adj]) {
                dfsHelper(adj, visited);
            }
        }
    }

	void print_output(int result) {
		std::ofstream fout("dfs.out");
		fout << result << '\n';
		fout.close();
	}
};

int main() {
	Task *task = new Task();
	task->solve();
	delete task;
	return 0;
}