CodeForces 115A

Party

Time Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 115A

Description

A company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee A is said to be the superior of another employee B if at least one of the following is true:

• Employee A is the immediate manager of employee B
• Employee B has an immediate manager employee C such that employee A is the superior of employee C.

The company will not have a managerial cycle. That is, there will not exist an employee who is the superior of his/her own immediate manager.

Today the company is going to arrange a party. This involves dividing all n employees into several groups: every employee must belong to exactly one group. Furthermore, within any single group, there must not be two employees A and B such that A is the superior of B.

What is the minimum number of groups that must be formed?

Input

The first line contains integer n (1 ≤ n ≤ 2000) — the number of employees.

The next n lines contain the integers p_i (1 ≤ p_i ≤ n or p_i = -1). Every p_i denotes the immediate manager for the i-th employee. If p_i is -1, that means that the i-th employee does not have an immediate manager.

It is guaranteed, that no employee will be the immediate manager of him/herself (p_i ≠ i). Also, there will be no managerial cycles.

Output

Print a single integer denoting the minimum number of groups that will be formed in the party.

Sample Input

Input

5
-1
1
2
1
-1

Output

3

Hint

For the first example, three groups are sufficient, for example:

• Employee 1
• Employees 2 and 4
• Employees 3 and 5
• 1. #include <iostream>  
  2. #include <cstdio>  
  3. #include <cstring>  
  4. #define LMT 2002  
  5. using namespace std;  
  6. int ans,n;  
  7. int father[LMT],is[LMT],next[LMT],all;  
  8. struct line  
  9. {  
  10.     int u,v,next;  
  11. }e[LMT];  
  12. void insert(int u,int v)  
  13. {  
  14.     e[all].u=u;  
  15.     e[all].v=v;  
  16.     e[all].next=next[u];  
  17.     next[u]=all++;  
  18. }  
  19. void dfs(int u,int lev)  
  20. {  
  21.     if(ans<lev)ans=lev;  
  22.     for(int x=next[u];x!=-1;x=e[x].next)  
  23.     dfs(e[x].v,lev+1);  
  24. }  
  25. int main()  
  26. {  
  27.     int p;  
  28.     scanf("%d",&n);  
  29.     memset(next,-1,sizeof(next));  
  30.     for(int i=1;i<=n;i++)  
  31.     {  
  32.         scanf("%d",&p);  
  33.         if(p==-1)is[i]=1;  
  34.         else insert(p,i);  
  35.     }  
  36.     for(int i=1;i<=n;i++)  
  37.     if(is[i])dfs(i,1);  
  38.     printf("%d\n",ans);  
  39.     return 0;  
  40. }