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

vector<int> L[100001];
int vis[100001];

void dfs(int node) {
    vis[node] = 1;
    for (auto vec : L[node]) {
        if (vis[vec] == 0) {
            dfs(vec);
        }
    }
}
int main() {
    ifstream f("../dfs.in");
    ofstream g("../dfs.out");
    int n, m;
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);  // pentru graf orientat - scoatem linia
    }
    int nr = 0;
    for (int i = 1; i <= n; i++) {
        if (vis[i] == 0) {
            nr++;
            dfs(i);
        }
    }
    g << nr; // nr componente conexe
    return 0;
}