#include <bits/stdc++.h>
            #include<iostream>
            #include<cstdio>
            #include<vector>
            #include<queue>
            #include<map>
            #include<cstring>
            #include<string>
            #include <math.h>
            #include<algorithm>
        //    #include <boost/multiprecision/cpp_int.hpp>
            #include<functional>
     #define int long long
            #define mod  1000000007
            #define pa pair<int,int>
            #define ll long long
            #define pal pair<double,int>
            #define ppa pair<int,pa>
            #define ssa pair<string,int>
            #define  mp make_pair
            #define  pb push_back
            #define EPS (1e-10)
            #define equals(a,b) (fabs((a)-(b))<EPS)
     
            using namespace std;
     //priority_queue<int, vector<int>, greater<int> > que;
            class Point{
            	public:
            	double x,y;
            	Point(double x=0,double y=0):x(x),y(y) {}
            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
            	Point operator * (double a) {return Point(x*a,y*a);}
            	Point operator / (double a) {return Point(x/a,y/a);}
            	double absv() {return sqrt(norm());}
            	double norm() {return x*x+y*y;}
            	bool operator < (const Point &p) const{
            		return x != p.x ? x<p.x: y<p.y;
            	}
            	bool operator == (const Point &p) const{
            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
            	}
            };
            typedef Point Vector;
     
            struct Segment{
            Point p1,p2;
            };
     
        double hen(Vector a){
        if(fabs(a.x)<EPS && a.y>0) return acos(0);
        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
        else if(a.y>0) return acos(a.x/a.absv());
        else return 2*acos(0)+acos(-a.x/a.absv());
     
        }
     
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}

int gcd(int v,int b){
	if(v>b) return gcd(b,v);
	if(v==b) return b;
	if(b%v==0) return v;
	return gcd(v,b%v);
}
            double dot(Vector a,Vector b){
            	return a.x*b.x+a.y*b.y;
            }
            double cross(Vector a,Vector b){
            	return a.x*b.y-a.y*b.x;
            }
        
double distans(double x1,double y1,double x2,double y2){
	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
	return sqrt(rr);
	
}
 
int beki(int a, int r){
	if(r==0)return 1;
	if(r==1) return a%mod; 
	if(r%2==1){
		int y=beki(a,r-1);
		return(y*a)%mod;
		
	}
	int yy=beki(a,r/2);
	return (yy*yy)%mod;
}
 
 int inf=mod*2;
 /*
 int kai[100000];
 int inv[100000];
int memo[1004][1004]={0};
*/
            //----------------kokomade tenpure------------
int a[100002]={0};
int dp[100002]={0};
vector<int> aite[100002];
vector<pa> ve;
bool sumi[100002]={0};
int dpc(int u){
	if(sumi[u]==1) return dp[u];
	if(aite[u].size()==0){
		sumi[u]=1;
		dp[u]=0;
		return 0;
	}
	sumi[u]=1;
	vector<int> r;
	for(int i=0;i<aite[u].size();i++){
		r.pb(dpc(aite[u][i]));
	}
	sort(r.begin(),r.end());
	int e=r.size();
	int w=0;
	for(int i=0;i<e;i++){
		
		w=max(w,r[i]+e-i);
		
	}
	dp[u]=w;
	return w;
	
}
    signed  main(){
int n;
    	cin>>n;
   a[1]=0;
    	for(int i=2;i<=n;i++){
    		cin>>a[i];
    		aite[a[i]].pb(i);
    	
    	}
    	for(int i=1;i<=n;i++){
    		ve.pb(mp(aite[i].size(),i));
    	}
    	sort(ve.begin(),ve.end());
    	
    	
    	
    	cout<<dpc(1)<<endl;
    //	cout<<memo[b][n]%mod<<endl;
    	return 0;
    }
    //printf("%d %.10f %.10f\n",i,xx/ri,yy/ri);

Measured memory_bytes: 18412