#include<cstdio>
#include<vector>
#define MAXN 100005
using namespace std;

int i , j , k , path[MAXN] ,comp , Sum , N , M , a, b;

vector <int> G[MAXN];

void read() 
{
     scanf("%d %d",&N ,&M);
     for( ; M -- ; ) {
          scanf("%d %d",&a,&b);
          G[a].push_back(b),G[b].push_back(a);
          }
}

void DFS(int X)
{
     int j;
     
     if(path[X]) return ;
     
     path[X] = 1;
     
     for( j = 0 ; j < G[X].size() ; j++)
          if(!path[G[X][j]])
            DFS(G[X][j]);
}

int main()
{
    freopen("DFS.in","r",stdin);
    freopen("DFS.out","w",stdout);
    
    read();
    
    for( i = 1 ; i <= N ; i++){
    if(!path[i]) {comp ++, DFS(i);}
}
    printf("%d\n",comp);

return 0;
}