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

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

int vizitat[100001], n;
vector < vector <int> > a;

int cont;

void dfs(int v)
{
    vizitat[v] = 1;
    for(const auto &item : a[v])
        if(vizitat[item] == 0)
            dfs(item);
}

int main()
{
    int m, i, x, y;
    f >> n >> m;
    for(i = 1; i <= m; i++)
    {
        f >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(int i = 1; i <= n; i++)
        if(vizitat[i] == 0)
        {
            cont++;
            dfs(i);
        }
    g << cont;
    return 0;
}