#include <fstream>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

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

const int MAXN = 100005;
int n, m;
bool f[MAXN];
vector<int> v[MAXN];

void dfs(int k) {
    for (int i = 0; i < v[k].size(); ++i) {
        if (f[v[k][i]] == 0) {
            f[v[k][i]] = 1;
            dfs(v[k][i]);
        }
    }
}

int main() {

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

    int sol = 0;
    for (int i = 1; i <= n; ++i) {
        if (f[i] == 0) {
            sol++;
            f[i] = 1;
            dfs(i);
        }
    }

    fout << sol;

    fout.close();
    return 0;
}