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

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

int lst[100001], vf[400001], urm[400001], nr;
bool viz[100001];

void adauga (int x, int y)
{
    nr++;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void dfs (int x)
{
    viz[x] = true;
    int y, p;
    p = lst[x];
    while (p != 0)
    {
        y = vf[p];
        if (!viz[y]) dfs(y);
        p = urm[p];
    }
}

int main()
{
    int n, m;
    int x, y;

    in >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        adauga(x, y);
        adauga(y, x);
    }
    int contor = 0;
    for (int i = 1; i <= n; i++)
        if (viz[i] == false)
        {
            dfs(i);
            contor++;
        }

    out << contor;
    return 0;
}