#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;

void Dfs(int node) {
    vector <int> :: iterator it;
    Vis[node] = true;
    for (it = G[node].begin(); it != G[node].end(); it++) {
        if (Vis[*it] == false) {
            Dfs(*it);
        }
    }
}

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