#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5;

void dfs(int node, vector<vector<int>> &g, vector<bool> &viz)
{
    viz[node] = true;
    for (auto &x : g[node])
        if (!viz[x])
            dfs(x, g, viz);
}

int main()
{
#ifdef LOCAL
    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);
#endif

    int n, m;

    cin >> n >> m;

    vector<vector<int>> g(n + 2);

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

    vector<bool> viz(n + 2, false);

    int cnt = 0;
    for (int i = 1; i <= n; ++i)
        if (!viz[i])
        {
            ++cnt;
            dfs(i, g, viz);
        }

    cout << cnt << '\n';

    return 0;
}