#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;

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

constexpr int NX = 100010;
int n, m, viz[NX], contor;
vector <int> V[NX];

void dfs(int nod)
{
    viz[nod] = contor;
    for(int i=0; i<V[nod].size(); ++i)
        if(!viz[V[nod][i]])
        dfs(V[nod][i]);
}
int main()
{
    fin>>n>>m; //citesc chestiile
    int x, y;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        V[x].push_back(y);
        V[y].push_back(x);
    }


    for(int i=1; i<=n; ++i) //parcurg din fiecare nod si leg componentele
    {
        if(viz[i]==0)
        {
            contor++; //cresc contorul pt fiecare componenta gasita
            dfs(i);
        }
    }

    fout<<contor;
    return 0;
}