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


#define int long long

int n;
const int mxN = 10000;
vector<vector<int>> adj, adj2, adj3;
vector<bool> vis;
vector<int> topOrd, num, num2, maxs;
int cnt = 1;

void dfs(int v) {
    vis[v] = 1;
    for(int u : adj[v]) {
        if(!vis[u]) {
            dfs(u);
        }
    }
    topOrd.push_back(v);
}

void dfs2(int v) {
    vis[v] = 1;
    num[v] = cnt;
    num2[cnt]++;

    for(int u : adj2[v]) {
        if(!vis[u]) {
            dfs2(u);
        }
    }
}

void dfs3(int v) {
    vis[v] = 1;
    int sum = 0;
    for(int u : adj3[v]) {
        if(!vis[u]) {
            dfs3(u);
        }
        sum += maxs[u];
    }
    maxs[v] = sum + num2[v];
}

signed main() {
    cin >> n;
    adj.assign(n+1, {});
    adj2.assign(n+1, {});
    adj3.assign(n+1, {});
    vis.assign(n+1, 0);
    num.assign(n+1, -1);
    num2.assign(n+1, 0);
    for(int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        adj2[x].push_back(i);
        adj[i].push_back(x);
        //cout << i << ' ' << x << endl;
    }


    for(int i = 1; i <= n; i++) {
        if (!vis[i]) {
            dfs(i);
        }
    }

    reverse(topOrd.begin(), topOrd.end());
    vis.assign(n+1, 0);

    for(int x : topOrd) {
        //cout << x << ' ';
        if(!vis[x]) {
            dfs2(x);
            cnt++;
        }
    }
    //cout << endl;
    cnt--;

    //for(int i = 1; i <= n; i++) cout <<num[i] << " " << i << endl;
    //cout << endl;
    //cout << endl;




    for(int i = 1; i <= n; i++) {
        if (num[adj[i][0]] != num[i]) {
            adj3[num[i]].push_back(num[adj[i][0]]);
            //cout << num[i] << " --> " << num[adj[i][0]] << "         " << i << " --> " << adj[i][0] << endl;
        }
    }


    vis.assign(cnt+1, 0);
    maxs.assign(cnt+1, 0);

    for(int i = 1; i <= cnt; i++) {
        if(!vis[i]) {
            dfs3(i);
        }
    }

    int maxx = 0;
    int maxind;

    for(int i = 1; i <= cnt; i++) {
        if (maxx < maxs[i]) {
            maxx = maxs[i];
            maxind = i;
        }
    }

    for(int i = 1; i <= n; i++) {
        if (num[i] == maxind) {
            cout << i << ' ' << maxx << endl;
            return 0;
        }
    }
}