#include <fstream>
#include <vector>

std::ifstream f ("dfs.in");
std::ofstream g ("dfs.out");

void dfs(int i, const std::vector<std::vector<int>>& adj, std::vector<bool>& marked) {
    marked[i] = true;
    for (int x : adj[i]) {
        if (!marked[x])
            dfs(x, adj, marked);
    }
}

int main() {
    int n, m;
    f >> n >> m;
    std::vector<std::vector<int>> adj(n+1);

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

    std::vector<bool> marked(n+1, false);

    int component_no = 0;
    for (int i = 1; i <= n; i++) {
        if (!marked[i]) {
            component_no++;
            dfs(i, adj, marked);
        }
    }

    g << component_no;

    return 0;
}