#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;

//GRAF NEORIENTAT
//Sa se determine numarul componentelor conexe ale grafului.

//DFS
//C.1-numararea componentelor conexe
ifstream f("dfs.in");
ofstream g("dfs.out");
const int nmax=100000;
vector<int>v[nmax+1]; 
int n,m,x,y;
int vis[nmax+1];//vector pt nodurile vizitate
void DFS(int x){
    vis[x]=1;
    for(auto next:v[x]){
        if(!vis[next])
            DFS(next);
    }
}

int main()
{
    f>>n>>m; //n=noduri, m=muchii
    //implementare cu lista de adiacenta
    for(int i=1;i<=m;i++){
        f>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int cnt=0;
    for(int i=1;i<=n;i++)
        if(!vis[i])
        {
            cnt++;
            DFS(i);
        }
    g<<cnt;
}