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

using namespace std;

const int MAXN = 100005;

vector<int> adj[MAXN];
bool viz[MAXN];

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

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

    int n, m;
    fin >> n >> m;

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

    int componente_conexe = 0;

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

    fout << componente_conexe << "\n";

    fin.close();
    fout.close();

    return 0;
}