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

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

vector <int> G[200005];

bool vizitat[200005];
int  n, x, m, y, insule = 0;

void DFS(int nod)
{
    for (unsigned int i = 0; i < G[nod].size(); i++)
    {
        if (vizitat[G[nod][i]] == 0)
        {
            vizitat[G[nod][i]] = 1;
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (int j = 1; j <= n; j++)
    {
        if (vizitat[j] == 0)
        {
            insule++;
            DFS(j);
        }
    }
    fout << insule;
    return 0;
}