#include <iostream>
#include <vector>
using namespace std;

vector<int> graph;
vector<bool> visited;
vector<int> length_of_message;
void dfs(int s)
{
visited[s]=true;
if(length_of_message[graph[s]]!=-1)
    {
    length_of_message[s]=length_of_message[graph[s]]+1;
    return;
    }
if(visited[graph[s]] )
    {
    int cnt=1;
    int i=graph[s];

    while(i!=s)
        {
        //cout<<i<<" "<<s<<endl;
        cnt++;
        i=graph[i];
        }
    length_of_message[i]=cnt;
    i=graph[s];

    while(i!=s)
        {
        length_of_message[i]=cnt;
        i=graph[i];
        }
    }
//cout<<"a";
if(!visited[graph[s]])
    dfs(graph[s]);
if(length_of_message[s]==-1)
    {
    length_of_message[s]=length_of_message[graph[s]]+1;
    }
return;
}


int main()
{
    int n;
    cin>>n;
    graph.resize(n+1);
    length_of_message.resize(n+1,-1);
    visited.resize(n+1,false);
    for(int i=1;i<=n;i++)
        {
        cin>>graph[i];
        }
    int max=-1,start;
    for(int i=1;i<=n;i++)
        {
        if(!visited[i])
            {
            dfs(i);
            }
        if(length_of_message[i]>max)
            {
            max=length_of_message[i];
            start=i;
            }
        }
    cout<<start<<" "<<max;
    return 0;
}