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

using namespace std;

int const nMax=100005;
vector<int> l[nMax];
bool viz[nMax];

void dfs(int node){
    viz[node] = true;
    for(int vec:l[node]){
        if(!viz[vec]){
            dfs(vec);
        }
    }
}

int main()
{
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");
    int n,m;
    fin>>n>>m;
    while(m--){
        int x,y;
        fin>>x>>y;
        l[x].push_back(y);
        l[y].push_back(x);

    }
    int nrComp=0;
    for(int i=1;i<=n;i++){
        if(!viz[i]){
            nrComp++;
            dfs(i);
        }
    }
    fout<<nrComp;
    return 0;
}