#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 1e5 + 5;
vector <int> g[NMAX];
int comp[NMAX];

void dfs(int node, int &repr){
    comp[node] = repr;

    for(auto &it: g[node])
        if(comp[it] == 0)
            dfs(it, repr);

}

int main()
{
    int n, m, i, j;

    fin >> n >> m;
    for(i = 1; i <= m; ++i){
        int a, b;
        fin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    int ans = 0;

    for(i = 1; i <= n; ++i)
        if(comp[i] == 0){
            ++ans;
            dfs(i, i);
        }

    fout << ans;

    return 0;
}