#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

ifstream f("dfs.in");
ofstream g("dfs.out");

vector<int> v[100010];

bitset<10000010> viz;

void dfs(int nod, int n)
{
    viz[nod] = 1;
    for (int i = 0; i < v[nod].size(); i++)
        if (!viz[v[nod][i]])
            dfs(v[nod][i], n);
}

int main()
{
    int n, m, x, y, contor = 0;
    f>>n>>m;
    for (int i = 1; i <= m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            contor++;
            dfs(i, n);
        }
    }
    g<<contor;
    return 0;
}