#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <unordered_map>
#include <stack>
#include <iomanip>

using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

const int MAX = 1e6 + 1;
set<int> visited;
vector<vector<int>> g(MAX);

void dfs(int node) {
    visited.insert(node);
    for (auto i: g[node]) {
        if (!visited.count(i)) {
            dfs(i);
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;

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

    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        if (!visited.count(i)) {
            ++ans;
            dfs(i);
        }
    }

    fout << ans;

    return 0;
}