#include <iostream>
#include <vector>

using namespace std;

int n;
vector<int> send;
vector<int> length;
vector<int> current;
vector<int> pos;

static void GetLength(int k)
{
    int e = current.size();
    if (length[k] != -1)
    {
        for (int i = 0; i < e; i++)
        {
            length[current[i]] = length[k] + e - i;
        }
        return;
    }
    if (pos[k] != -1)
    {
        int i = pos[k];
        for (int j = i; j < e; j++)
        {
            length[current[j]] = e - i;
        }
        for (int j = 0; j < i; j++)
        {
            length[current[j]] = e - j;
        }
        return;
    }
    pos[k] = e;
    current.push_back(k);
    GetLength(send[k] - 1);
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int in;
        cin >> in;
        send.push_back(in);
        length.push_back(-1);
        pos.push_back(-1);
    }
    for (int i = 0; i < n; i++)
    {
        if (length[i] == -1)
        {
            fill(pos.begin(), pos.end(), -1);
            current.clear();
            GetLength(i);
        }
    }
    int max = 0, s = -1;
    for (int i = 0; i < n; i++)
    {
        if (length[i] > max)
        {
            max = length[i];
            s = i + 1;
        }
    }
    cout << s << " " << max;
    return 0;
}