#include <fstream>
#include <vector>
#define NMAX 102

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

int n, start, nr;
vector<int> G[NMAX];
bool viz[NMAX]; ///viz[x]==1 daca x a fost vizitat
void citire();
void dfs(int x);

int main()
{
    int i;
    citire();
    for (i=1; i<=n; i++)
        if (!viz[i])
        {
            nr++;
            //fout<<"componenta conexa "<<nr<<": ";
            dfs(i);
            //fout<<'\n';
            }
            fout<<nr;
    return 0;
}
void citire()
{
    int i, m, x, y;
    ///neorientat
    fin>>n>>m;
    for (i=0; i<m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);///pt graf orientat nu mai facem aceasta atribuire
    }
}
void dfs(int x)
{
    int i;
    //fout<<x<<" ";
    viz[x]=1;
    for (i=0; i<G[x].size(); i++)
        if (!viz[G[x][i]])
            dfs(G[x][i]);
}