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

using namespace std;
int n,m,cont;
vector<int> a[1000000];
int viz[1000000];

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

void DFS(int x){
    if(x>n)return;
    else {
        for(auto y:a[x]){
            if(viz[y]==0){
                viz[y]=1;
                DFS(y);
            }
        }
    }
}

int main()
{
    int x,y;
    f>>n>>m;
    for(int i=1;i<=n;i++){
        f>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }

    for(int i=1;i<=n;i++){
        if(viz[i]==0){
            ++cont;
            DFS(i);
        }
    }
    g<<cont;
    return 0;
}