#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector <int> a[1000];

int n, m;

void citire()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
}

bool vizitat[10000];

int dfs(int nod)
{
    vizitat[nod] = true;
    for (int i = 0; i < a[nod].size(); i++)
    {
        if (vizitat[a[nod][i]] == false)
        {
            dfs(a[nod][i]);
        }
    }
}

int main()
{
    citire();
    int contor = 0;
    for (int i = 1; i <= n; i++)
    {
        if (vizitat[i] == false)
        {
            dfs(i);
            contor++;
        }
    }
    fout << contor;
}