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

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

void DFS(int nod,vector<int>&viz,vector<vector<int>>&G)
{
    viz[nod]=1;

    for (auto vecin:G[nod])
        if (!viz[vecin])
            DFS(vecin,viz,G);
}

int main()
{
    int n,m,x,y;

    f>>n>>m;

    vector<vector<int>> G(n+1);
    vector<int>viz(n+1,0);

    for (int i=0; i<m; i++)
    {
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    int nr=1;
    DFS(1,viz,G);

    for (int i=1; i<=n; i++)
        if (!viz[i])
        {
            DFS(i,viz,G);
            nr++;
        }

    g<<nr;

}