#include <fstream>
#include <vector>
#include <queue>

const int NMAX = 1e5;
std::vector<int> G[NMAX+1];
int vis[NMAX+1], d[NMAX+1];

void DFS(int x){
    vis[x] = 1;
    for(auto next:G[x])
        if(!vis[next])
            DFS(next);
}

int main() {
    int n, m, s;
    std::ifstream f;
    std::ofstream g;
    f.open("dfs.in");
    f>>n>>m;
    for(int i = 1; i <= m; i++){
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    f.close();
    int cc = 0;
    for(int i = 1; i <= n; i++){
        if(!vis[i]){
            cc++;
            DFS(i);
        }
    }
    g.open("dfs.out");
    g<<cc;
    g.close();
    return 0;
}