/**Se da un graf neorientat cu N noduri si M muchii.
Sa se determine numarul componentelor conexe ale grafului.*/
#include <iostream>
#include <fstream>
#include <queue>
#define Nmax 200010
using namespace std;
ifstream fin("dfs.in");
ofstream gout("dfs.out");
int n,m,x,y, viz[Nmax],nr;
vector <int> G[Nmax];
queue <int> Q;
void citire()
{
    fin>>n>>m;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
}
void dfs(int v)
{
    viz[v]=1;
    for(vector <int> :: iterator it=G[v].begin();it!=G[v].end();++it)
        if(!viz[*it])
            dfs(*it);
}
int numarare()
{
    int nr=0;
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            {
                dfs(i);
                nr++;
            }
    return nr;
}
int main()
{
    citire();
    gout<<numarare();
    return 0;
}