#include <bits/stdc++.h>
using namespace std;

#define NMAX 100009

class Task {
public:
    void solve() {
        read_input();
        print_output(get_result());
    }

private:
    int n, m;

    vector<int> adj[NMAX];

    void read_input() {
        cin >> n >> m;

        for (int i = 1; i <= m; ++i) {
            int x, y;

            cin >> x >> y;

            adj[x].push_back(y);
            adj[y].push_back(x);
        }
    }

    void print_output(int ccNum) {
        cout << ccNum;
    }

    int get_result() {
       return do_dfs();
    }

    int do_dfs() {
        vector<int> used(n + 1, 0);
        int ccNum = 0;
    
        for (int i = 1; i <= n; ++i) {
            if (!used[i]) {
                ccNum++;
                dfs(i, used);
            }
        }

        return ccNum;
    }

    void dfs(int& node, vector<int>& used) {
        used[node] = 1;
        // cout << node << " ";

        for (auto& it : adj[node]) {
            if (!used[it]) {
                dfs(it, used);
            }
        }
    }
};

int main() {
    // daca las linia asta citesc din fisier
    assert(freopen("dfs.in",  "r", stdin)); 

    // daca las linia asta afisez in fisier
    assert(freopen("dfs.out", "w", stdout));

    Task *task = new Task();
    task->solve();
    delete task;

    return 0;
}