#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

void dfs(int nod, const vector<vector<int>>& adj, vector<bool>& viz) {
    viz[nod] = true;

    for (int vecin : adj[nod]) {
        if (!viz[vecin]) {
            dfs(vecin, adj, viz);
        }
    }
}

int main() {
    ifstream f("dfs.in");
    ofstream fout("dfs.out");

    int n, m;
    f >> n >> m; 

    vector<vector<int>> adj(n + 1);

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

    vector<bool> viz(, false);
    int componente_conexe = 0;

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

    fout << componente_conexe << "\n";

    f.close();
    fout.close();

    return 0;
}