C++ :

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

int main(){
	vector<vector<int> > v(100010);
	int n,num;
	cin >>n;
	for(int i=2;i<=n;i++){
		cin >>num;
		v[num].push_back(i);
	}
	for(int i=1;i<=n;i++){
		int count =0;
		for(int j=0;j<v[i].size();j++){
			count+=v[v[i][j]].size();
		}
		v[i].push_back(count);
	}
	int p=n,max=-1;
	for(int i=n;i>=1;i--){
		if(v[i][v[i].size()-1]>=max){
			max=v[i][v[i].size()-1];
			p=i;
		}
	}
	cout <<p<<' '<<max<<endl;
	return 0;
}