#include <bits/stdc++.h>

using namespace std;

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

int viz[100003],i,n,m,x,y,j;
vector <int> g[100004];

void dfs(int nod)
{
    viz[nod]=1;
    //g<<nod<<" ";
    for(auto& it : G[nod])
    {
        if(viz[it]==0)
            dfs(it);
    }
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    int nr=0;
    for(i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            nr++;
            dfs(i);
        }
    }
    fout<<nr;
    return 0;
}