#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

const int LimNoduri = 10000;
vector <int> edge[LimNoduri];
bool viz[LimNoduri];
int n1,n2,n,m,k;

void DFS(int Nod)
{
    viz[Nod] = true;
    for(unsigned int i=0; i<edge[Nod].size();i++)
    {
        int next = edge[Nod][i];
        if(!viz[next])
        {
            DFS(next);
        }
    }
}

void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>n1>>n2;
        edge[n1].push_back(n2);
        edge[n2].push_back(n1);
    }
}


int main()
{
    citire();
    for(int i=1;i<=n;i++)
    {
        if(!viz[i])
        {
            k++;
            DFS(i);
        }
    }
    fout<<k;
    return 0;
}