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

using ll = long long;
using pll = pair<ll,ll>;
using vll = vector<ll>;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using vai = vector<array<int, 3>>;

#define x first
#define y second
#define all(x) x.begin(), x.end()

vi connect;
vi dp;

int regist_cycle=-1;

void dfs(int node) {
    dp[node] = -2;
    if (dp[connect[node]] == -1) {
        dfs(connect[node]);
        dp[node] = dp[connect[node]]+1;
    } else if (dp[connect[node]] == -2) {
        dp[node] = 0;
        regist_cycle = connect[node];
    } else {
        dp[node] = dp[connect[node]]+1;
    }

    if (regist_cycle == node) {
        int nex = connect[node];
        while (nex != node) {
            dp[nex] = dp[node];
            nex = connect[nex];
        } regist_cycle = -1;
    }
}

void solve() {
    int n; cin >> n;
    connect.resize(n);
    dp.resize(n, -1);
    for (int i = 0; i < n; i++) {
        int in; cin >> in; in--;
        connect[i] = in;
    }

    for (int i = 0; i < n; i++) {
        if (dp[i] == -1) dfs(i);
    }

    int kell = *max_element(all(dp));
    for (int i = 0; i < n; i++) {
        if (dp[i] == kell) {
            cout << i+1 << " " << dp[i]+1;
            return;
        }
    }
}

int main() {
	ios::sync_with_stdio(0);
    cin.tie(0);

    int t=1;
    //cin >> t;
    while (t--) {
        solve();
    }
}