// Source: https://usaco.guide/general/io

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

vector<int> v,vis,scc,kil,dp,temp;
vector<vector<int>> w;

void dfs(int i){
    vis[i]=1;
    if(vis[v[i]]==0){
        dfs(v[i]);
    }
    kil.push_back(i);
}

void dfs2(int i, int cnt){
    vis[i]=1;
    scc[i]=cnt;
    for(int u:w[i]){
        if(vis[u]==0){
            dfs2(u,cnt);
        }
    }
}

void dfs3(int i){
    vis[i]=1;
    if(vis[v[i]]==0&&temp[scc[v[i]]]<2){
        dfs3(v[i]);
    }
    dp[i]=dp[v[i]]+1;
}

signed main() {
    int n;cin>>n;
    v.resize(n);
    vis.resize(n);
    scc.resize(n);
    w.resize(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
        v[i]--;
        w[v[i]].push_back(i);
    }
    for(int i = 0;i<n;i++){
        if(vis[i]==0){
            dfs(i);
        }
    }
    for(int i = 0;i<n;i++){
        vis[i]=0;
    }
    int cnt=0;
    reverse(kil.begin(),kil.end());
    for(int i = 0;i<n;i++){
        if(vis[kil[i]]==0){
            cnt++;
            dfs2(kil[i],cnt);
        }
    }
    temp.resize(cnt+1);
    for(int i = 0;i<n;i++){
        temp[scc[i]]++;
    }
    dp.resize(n);
    for(int i = 0;i<n;i++){
        vis[i]=0;
        if(temp[scc[i]]>1){
            dp[i]=temp[scc[i]];
        }
    }
    for(int i = 0;i<n;i++){
        if(vis[i]==0&&temp[scc[i]]<2){
            dfs3(i);
        }
    }
    int indi=0;
    for(int i = 0;i<n;i++){
        if(dp[i]>dp[indi])indi=i;
    }
    cout<<indi+1<<' '<<dp[indi]<<endl;
}