#include <iostream>
#include <vector>

using std::vector;

int dfs(int n, vector<int> & graph, vector<int> & d, int x, vector<bool> & inStack) {
    if(d[x] != -1)
        return d[x];
   if(inStack[x]) {
      int cur = graph[x];
      int cnt = 1;
      while(cur != x) {
         cnt++;
         cur = graph[cur];
      }
      cur = graph[x];
      d[x] = cnt;
      while(cur != x) {
         d[cur] = cnt;
         cur = graph[cur];
      }
      return d[x];
   }

   inStack[x] = 1;

   int cur = 1 + dfs(n, graph, d, graph[x], inStack);

   if(d[x] == -1)
      d[x] = cur;

   return d[x];
}

int main() {
    int n, max = -1, maxIdx = -1;
    std::cin >> n;
    vector<int> graph(n), d(n, -1);
    for(int i = 0; i < n; i++) {
        std::cin >> graph[i];
        graph[i]--;
    }

    for(int i = 0; i < n; i++) {
        if(d[i] == -1) {
            vector<bool> inStack(n, 0);
            d[i] = dfs(n, graph, d, i, inStack);
        }
        if(d[i] > max) {
            max = d[i];
            maxIdx = i;
        }
    }
   std::cout << maxIdx + 1 << ' ' << max;
}