#include <fstream>
#include <vector>

using namespace std;

void dfs(int node, const vector<vector<int>>& adj, vector<bool>& viz) {
    viz[node] = true;
    for (int vec : adj[node]) {
        if (!viz[vec]) {
            dfs(vec, adj, viz);
        }
    }
}

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

    int n, m;
    fin >> n >> m;
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector<bool> viz(n + 1, false);
    int con = 0;

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

    fout << con << "\n";
    fin.close();
    fout.close();

    return 0;
}