#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

const int MAXN = 100000;

vector<int> G[MAXN + 1];
bool viz[MAXN + 1];
int N, M;

void dfs(int nod) {
    viz[nod] = true; 
    for (int vecin : G[nod])
        if (!viz[vecin])
            dfs(vecin);
}

int main() {
    ifstream cin("dfs.in");
    ofstream cout("dfs.out");

    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x); 
    }

    int componente = 0;
    for (int i = 1; i <= N; i++) {
        if (!viz[i]) {
            componente++;
            dfs(i);
        }
    }

    cout << componente;
    return 0;
}