#include<stdio.h>
#include<vector>

#define maxn 100005

using namespace std;

vector <int> vecini[maxn];
int n,m,viz[maxn],size;

void citire()
{
	freopen("dfs.in","r",stdin);
	scanf("%d %d",&n,&m);
	int x,y;
	for(int i=1;i<=m;i++)
	{ 
		scanf("%d %d",&x,&y);
		vecini[x].push_back(y);
	}
}

void dfs(int nod)
{
	int p;
	viz[nod]=1;
	size=vecini[nod].size();
	for(int i=0;i<size;i++)
	   {
		   p=vecini[nod][i];
		   if(viz[p]==0)
		   dfs(p);
	}
}

int main()
{
	freopen("dfs.out","w",stdout);
	citire();
	int cnt=0;
	for(int i=1;i<=n;i++)
		if(viz[i]==1) cnt++,dfs(i);
	printf("%d",cnt);
}