#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

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

int N,M,s;
const int N_MAX = 1e5 + 5;
bool use[N_MAX];
vector <int> G[N_MAX];

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

int main(){
    in >> N >> M;
    for (int i = 0; i < M; ++i){
        int x,y;
        in >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (int i = 1; i <= N; ++i)
        if (!use[i]){
            ++s;
            dfs(i);
        }
    out << s;
    return 0;
}