#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");

int viz[100005];
vector<int> v[100005];

void dfs(int node)
{
    viz[node] = 1;
    for (auto i : v[node])
    {
        if (viz[i] == 0)
        {
            dfs(i);
        }
    }
}
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int conexe = 0;
    for (int i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
        {
            conexe++;
            dfs(i);
        }
    }
    fout << conexe;
    return 0;
}