// UUID: 03cf9dac-c750-43a8-aa29-05b59e81aa3f
#include <bits/stdc++.h>
using namespace std;

void dfs(int a, int dis, const vector<vector<int>> &g, vector<int> &dist) {
	dist[a] = dis;
	for(auto i : g[a]) {
		dfs(i, dis+1, g,dist);
	}
}

int main() {
	int n; cin >> n;
	vector<int> x(n+1);
	vector<vector<int>> g(n+1);
	vector<int> indeg(n+1);
	vector<bool> kor(n+1, true);
	vector<int> dist(n+1, 0);
	for(int i = 1; i <= n; i++) {
		int a; cin >> a;
		x[i] = a;
		g[a].push_back(i);
		indeg[a]++;
	}
	queue<int> q;
	for(int i = 1; i <= n; i++) {
		if(indeg[i] == 0) q.push(i);
	}
	while(q.size() != 0) {
		int w = q.front();
		q.pop();
		kor[w] = false;
		indeg[x[w]]--;
		if(indeg[x[w]] == 0) q.push(x[w]);
	}
	for(int i = 1; i <= n; i++) {
		if(kor[i] == true && dist[i] == 0) {
			int dis = 1;
			int z = x[i];
			while(z != i) {
				dis++;
				z = x[z];
			}
			dist[i] = dis;
			z = x[i];
			while(z != i) {
				dist[z] = dis;
				z = x[z];
			}
		}
	}
	for(int i = 1; i <= n; i++) {
		if(kor[i] == true) {
			for(auto j : g[i]) {
				if(kor[j] == false) {
					dfs(j, dist[i]+1,g,dist);
				}
			}
		}
	}
	int ans = 0;
	int ln = 0;
	for(int i = 1; i <= n; i++) {
		if(dist[i] > ln) {
			ln = dist[i];
			ans = i;
		}
	}
	cout << ans << " " << dist[ans];
}