#include<bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");

const int nMax=100001;
vector<int> v[nMax];
//int vis[100001]={0};
vector<int> vis;
int n,m,nrcomp=0,x,y;

/*void add(int node1,int node2){
    v[node1].push_back(node2);
}*/
void dfs(int node){
    int i;
    vis[node]=nrcomp;
    //cout<<node<<" ";
    for(i=0;i<v[node].size();i++){
        if(!vis[v[node][i]]){
            dfs(v[node][i]);
        }
    }
}
int main(){
    int i;
    //f>>n>>m;
     cin>>n>>m;
    for(i=0;i<m;i++){
        cin>>x>>y;
        //f>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i=0;i<=n;i++)
    {
        vis.push_back(0);
    }
    //dfs(1);
    for(i=1;i<=n;i++)
    {
        if(vis[i]==0){
            nrcomp++;
            dfs(i);
        }
    }
    //g<<nrcomp;
    cout<<nrcomp;
}