#include <iostream>
#include <vector>

using namespace std;

const int MAXN = 100005;
vector<int> adj[MAXN];
bool vizitat[MAXN];

void parcurgere_dfs(int nod) {
    vizitat[nod] = true;
    for (int vecin : adj[nod]) {
        if (!vizitat[vecin]) {
            parcurgere_dfs(vecin);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);

    int n = 0, m = 0; 
    cin >> n >> m;

    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    int componente_conexe = 0;
    
    for (int i = 1; i <= n; ++i) {
        if (!vizitat[i]) {
            componente_conexe++;
            parcurgere_dfs(i);
        }
    }

    cout << componente_conexe << "\n";

    return 0;
}