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

int N;
int C[300000];
int dp[300000];
int path[300000];
int pos[300000];

int main() {

    cin >> N;
    for (int i = 1; i <= N; i++) cin >> C[i];

    for (int i = 1; i <= N; i++) pos[i] = -1;

    for (int i = 1; i <= N; i++) {
        if (dp[i] != 0) continue;

        int len = 0;
        int u = i;

        while (dp[u] == 0 && pos[u] == -1) {
            pos[u] = len;
            path[len++] = u;
            u = C[u];
        }

        if (dp[u] != 0) {
            int v = dp[u];
            for (int j = len - 1; j >= 0; j--) {
                v++;
                dp[path[j]] = v;
            }
        } else {
            int start = pos[u];
            int cycle_len = len - start;

            for (int j = start; j < len; j++)
                dp[path[j]] = cycle_len;

            int v = cycle_len;
            for (int j = start - 1; j >= 0; j--) {
                v++;
                dp[path[j]] = v;
            }
        }

        for (int j = 0; j < len; j++)
            pos[path[j]] = -1;
    }

    int best = 1;
    for (int i = 2; i <= N; i++)
        if (dp[i] > dp[best]) best = i;

    cout << best << " " << dp[best] << "\n";
    return 0;
}