#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;

const int NMAX = 1e5 + 10, mod = 1e9 + 7;
int n, m;
bool viz[NMAX];
vector<int> g[NMAX];

void dfs(int node) {
    viz[node] = 1;
    for (auto u: g[node])
        if (!viz[u]) dfs(u);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

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