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


vector <int> L[100001];
int viz[10001];



void DFS(int x, int comp){

    viz[x]=1;

    for(auto vecin: L[x]){
        if(!viz[vecin]){
            viz[vecin]=1;
            DFS(vecin, comp);
        }
    }

}


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

    int n, m;
    cin>>n>>m;

    int comp=0;

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

    for(int i=1; i<=n; i++){
        while(!viz[i]){
            DFS(i, ++comp);
        }
    }

    cout<<comp;

    return 0;
}