#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pi;
typedef vector <ll> vi;

const ld PI =  3.1415926535897932384626433832795L;
const ld eps=1e-9;
const int mod = 1e9 + 7;
const int inf = INT_MAX;
const int N = 10500, M = 100500;


#define F first
#define S second
#define PB push_back
#define rs resize

ll n,m,k,a,b,i,j,x,sum;
ll ans=0;
ll l=0,r=1e18;
bool f=1;
int dd[4][2]={{1,0},{0,1},{-1,0},{0,-1}};

vi son[N];
vi dp(N);

ll fun(ll v){
    if(son[v].empty()){
        return 1;
    }
    if(dp[v]) return dp[v];

    for(auto e:son[v]){
        dp[v] = max(dp[v],fun(e) + 1);
    }
    ans = max(ans,dp[v]);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cout<<fixed<<setprecision(20);
    /*freopen("longpath.in", "r", stdin);
    freopen("longpath.out", "w", stdout);*/
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        ll v,to;
        cin>>v>>to;
        son[v].PB(to);
    }
    for(int i=1;i<=n;i++)
    {
        if(!dp[i]) fun(i);
    }
    cout<<ans-1<<endl;
    return 0;
}