#include <stdio.h>
#include <stdlib.h>
typedef struct node{
 int info;
 struct node *next;
} node;
node *L[100001];

int viz[100001],N,M;

void DFS(int x)
{ node *c;
  viz[x]=1;
  c=L[x];
  while(c)
  {
     if(!viz[c->info])  DFS(c->info);
     c=c->next;
   }
}
int main()
{  node *p;
   int i,nrcomp=0,k,j;
   
   freopen("dfs.in","r",stdin);
   freopen("dfs.out","w",stdout);
   scanf("%d %d",&N,&M);
   for(k=1;k<=M;k++)
   { scanf("%d %d",&i,&j);
     if(!(p=(node*)calloc(1,sizeof(node)))) return;  //se adauga j in lista vecinilor lui i
     p->info=j;
     p->next=L[i];
     L[i]=p;
    }
   
   for(i=1;i<=N;i++)
   if(viz[i]==0) { nrcomp++; DFS(i); }
   printf("%d",nrcomp);

  return 0;
}