#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int NMAX = 100000;
vector<int> graf[1 + NMAX];
bool vizitat[1 + NMAX];
queue<int> q;
void bfs(int nodCrt)
{
    vizitat[nodCrt] = 1;
    q.push(nodCrt);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int i = 0; i < graf[nod].size(); i++)
        {
            int vecin = graf[nod][i];
            if(!vizitat[vecin])
                vizitat[vecin] = 1, q.push(vecin);
        }
    }
}

int main()
{
    ifstream in("dfs.in");
    ofstream out("dfs.out");

    int n, m;
    in >> n >> m;
    for (int j = 1; j <= m; j++)
    {
        int x, y;
        in >> x >> y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }

    int nrCompCon = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!vizitat[i])
        {
            nrCompCon++;
            bfs(i);
        }
    }

    out << nrCompCon << '\n';

    return 0;
}