#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

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

const int maxn = 1e5 + 5;
vector <int> G[maxn];
bitset <maxn> Vis;
int n, m;

void Dfs(int node) {
    Vis[node] = true;
    for (auto &it : G[node]) {
        if (Vis[it] == false) Dfs(it);
    }
}

int main() {
    ios_base :: sync_with_stdio (false);
    int x, y, ans = 0;
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (int i = 1; i <= n; i++) {
        if (Vis[i] == false) {
            ans++;
            Dfs(i);
        }
    }
    fout << ans << "\n";
    fin.close();
    fout.close();
    return 0;
}