#include <iostream>
#include <vector>
#include <climits>

using namespace std;

void dfs(int a, int d, vector<int> &to, vector<int> &state, vector<int> &ans, vector<int> &depth)
{
    state[a] = 1;
    depth[a] = d;

    int b = to[a];

    if(state[b] == 0)
    {
        dfs(b, d + 1, to, state, ans, depth);

        if(ans[a] == 0) ans[a] = ans[b] + 1;
    }else if(state[b] == 1)
    {
        int len = d - depth[b] + 1;

        ans[b] = len;

        int x = to[b];

        while(x != b)
        {
            ans[x] = len;
            x = to[x];
        }
    }else
    {
        ans[a] = ans[b] + 1;
    }

    state[a] = 2;
}

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

    vector<int> to(n + 1);

    for(int i = 1; i <= n; i++)
    {
        cin >> to[i];
    }
    
    vector<int> ans(n + 1);

    int maxe = INT_MIN;
    int index;

    vector<int> state(n + 1);
    vector<int> depth(n + 1);

    for(int i = 1; i <= n; i++)
    {
        if(state[i] == 0)
        {
            dfs(i, 0, to, state, ans, depth);
        }

        if(ans[i] > maxe)
        {
            maxe = ans[i];
            index = i;
        }
    }

    cout << index << " " << maxe;

    return 0;
}