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

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

int componente;
vector <int> v[100005];
bool vizitat[100005];

void dfs(int nod){
    vizitat[nod] = true;
    for(unsigned int i = 0; i < v[nod].size(); i++){
        int vecin = v[nod][i];
        if(vizitat[vecin] == 0)
            dfs(vecin);
    }
}

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);
    }

    for(int i = 1; i <= n; i++)
    {
        if(vizitat[i] == 0){
            componente++;
            dfs(i);
        }
    }

    fout << componente;
    return 0;
}