#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

vector<int> L[100001];
vector<int>::iterator it;
queue<int> c;
int n,m,i,j,kont,E[100001];

void bf(int nod)
{
    c.push(nod);
    E[nod]=1;
    while (!c.empty())
    {
        for (it=L[c.front()].begin(); it!=L[c.front()].end(); it++)
            if (!E[*it]) c.push(*it);
        E[c.front()]=1;
        c.pop();
    }
}

int main()
{
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d\n",&i,&j);
        L[i].push_back(j);
    }
    for (i=1; i<=n; i++) E[i]=0;
    c.push(1);
    kont=0;
    for (i=1; i<=n; i++)
        if (!E[i])
        {
            kont++;
            bf(i);
        }
    printf("%d",kont);
    return 0;
}