#include <iostream>
#include<cstdio>
using namespace std;
const int N=100005;
int vf[2*N];
int urm[2*N];
int lst[N];
bool viz[N];
int nr;
void adauga(int x,int y){
  nr++;
  vf[nr]=y;
  urm[nr]=lst[x];
  lst[x]=nr;
}
void dfs(int x){
  viz[x]=true;
  int p,y;
  p=lst[x];
  while(p!=0){
    y=vf[p];
    if(!viz[y]){
      dfs(y);
    }
    p=urm[p];
  }
}
int main()
{
    FILE*fin,*fout;
    fin=fopen("dfs.in","r");
    fout=fopen("dfs.out","w");
    int x,y,n,m,i,comp=0;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
      fscanf(fin,"%d%d",&x,&y);
      adauga(x,y);
      adauga(y,x);
    }
    for(i=1;i<=n;i++){
      if(viz[i]==false){
        comp++;
        dfs(i);
      }
    }
    fprintf(fout,"%d",comp);
    return 0;
}