#include <algorithm>
#include <cassert>
#include <climits>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

#define MAXN 100001

vector<int> g[MAXN];
int n, m;
int components = 0;

bool visited[MAXN];

void dfs(int node) {
    visited[node] = true;
    for (int &u : g[node]) {
        if (!visited[u]) {
            dfs(u);
        }
    }
}

int main() {
    // stuff
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");

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

    for (int i = 1; i <= n; i++) {
        visited[i] = false;
    }

    for (int i = 1; i <= n; i++) {
        if (!visited[i]) {
            components++;
            dfs(i);
        }
    }

    fout << components << '\n';

    fin.close();
    fout.close();

    return 0;
}