#include <iostream>
#include <bits/stdc++.h>
#include <vector>

using namespace std;

int index(map<int, int> map)
{
    int legn = 0;
    int ind = 0;
    for (int i = 0; i < map.size(); i++)
    {
        if (map[i] > legn) {
            legn = map[i];
            ind = i;
        }
    }
    return ind;
}

int main()
{
    int n;
    cin >> n;
    vector<int> bejgli(0);
    int m;
    vector<int> bejglinagy(n);
    for (int i = 0; i < n; i++)
    {
        cin >> m;
        bejglinagy[i] = m;
    }
    for (int i = 0; i < n; i += bejglinagy[i])
    {
        bejgli.push_back(bejglinagy[i]);
    }
    // 2n < n**2
    cout << bejgli.size() << endl;
    map<int, int> sok;
    for (auto i: bejgli)
    {
        ++sok[i];
    }
    cout << index(sok);
}