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

using namespace std;

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

bool vizitat[1000];

void dfs(vector<vector<int>> l, int nod)
{
    vizitat[nod] = true;
    for (int i = 0; i < l[nod].size(); i++)
        if (vizitat[l[nod][i]] == false)
        {
            dfs(l, l[nod][i]);
        }
}

int main()
{
    int n, m;
    in >> n >> m;
    vector<vector<int>> noduri(n + 1);
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        noduri[x].push_back(y);
        noduri[y].push_back(x);
    }
    int nr = 0;
    for (int i = 1; i <= n; i++)
    {
        if (vizitat[i] == false)
        {
            dfs(noduri, i);
            nr++;
        }
    }
    out << nr;
    return 0;
}