// UUID: f498104c-176d-4ad3-9130-fd739898d707
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

vector<int> c;
vector<int> eler;
vector<int> volt;
int bejid = 1;

void bejar(int kezd) {
	int id = bejid++;
	vector<int> erintett;
	int u = kezd;

	while (true) {
		volt[u] = id;
		erintett.push_back(u);

		int kov = c[u];

		if (volt[kov] == id) {
			int hossz = 1;
			for (int i = (int)erintett.size() - 1; erintett[i] != kov; i--) hossz++;

			bool korben = false;
			for (int x : erintett) {
				if (x == kov) korben = true;
				if (korben) eler[x] = hossz;
			}

			for (int i = (int)erintett.size() - 1; i >= 0; i--) {
				int x = erintett[i];
				if (eler[x]) continue;
				eler[x] = eler[c[x]] + 1;
			}

			return;
		}

		if (eler[kov] > 0) {
			int val = eler[kov];
			for (int i = (int)erintett.size() - 1; i >= 0; i--) {
				eler[erintett[i]] = val + 1;
				val++;
			}
			return;
		}

		u = kov;
	}
}

int main() {
	int n;
	cin >> n;

	c.assign(n + 1, 0);
	eler.assign(n + 1, 0);
	volt.assign(n + 1, 0);

	for (int i = 1; i <= n; i++) cin >> c[i];

	for (int i = 1; i <= n; i++) {
		if (!eler[i]) bejar(i);
	}

	int leg = 1;

	for (int i = 2; i <= n; i++) {
		if (eler[i] > eler[leg]) leg = i;
	}

	cout << leg << ' ' << eler[leg];
}