#include <stdio.h>
#include <vector>
#include <stack>
#define dim 100000
using namespace std;

vector <int> a[dim];
bool v[dim];
int n,cmp;
long long m;

void dfs(int nod)
{
    unsigned int i;
    v[nod] = true; //mark as visited
    for(i=0;i<a[nod].size();i++)
        if (v[a[nod][i]]==false)
            dfs(a[nod][i]);

}

int main()
{
    int x1,x2;
    long long i;
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);
    scanf("%d %lld",&n,&m);
    for (i=0;i<m;i++)
    {
        scanf("%d %d",&x1,&x2);
        a[x1-1].push_back(x2-1);
    }
    for (i=0;i<n;i++)
        if (v[i]==false)
        {
            dfs(i);
            cmp++;
        }
    printf("%d\n",cmp);
    return 0;
}