#include <iostream>
using namespace std;

int prim(int n)
{
    if(n == 0 || n == 1) return 0;
    if(n % 2 == 0 && n != 2) return 0;
    if(n == 2) return 1;
    for(int d = 3 ; d * d <= n ; d = d + 2)
        if(n % d == 0)
            return 0;
    return 1;
}
int nrdivprim(int a)
{
    int cnt = 0;
    for(int d = 1 ; d * d <= a ; d++)
        if(a % d == 0)
    {
        if(prim (d) == 1)
            cnt++;
        if(prim (a / d)  == 1 && d * d != a)
            cnt++;
    }
    return cnt;
}
int main()
{
    long long n , x , max1 = 0 , nrmax , cnt = 0 , y;

    cin >> n;

    max1 = nrdivprim (n);
    nrmax = n;

    while(x != n)
    {
        cin >> x;

        n = y;

        if(nrdivprim(x) > max1)
            {max1 = nrdivprim (x);nrmax = x;}
        else
            if(nrdivprim( x ) == max1)
                nrmax = max(nrmax , x);
        y = x;

    }
    cout <<nrmax << " " << max1;
}