#include<iostream>
using namespace std;
int main()
{
    long long len=1,maxlen=0,sum=0,maxsum=0,n = 0,km[200],maxdel=0;
    cin>>n;

    for(long long br=0; br<180; br++)
    {
        km[br]=0;
    }
    for(long long br=0; br<n-1; br++)
    {
        cin>>km[br];
    }
    for(long long br=0; br<n-1; br++)
    {
        sum=km[br];
        len=1;
        long long id=1;
        while(br+id<n)
        {
            if(km[br+id-1]>=km[br+id])
            {
                break;
            }
            sum=sum+km[br+id];
            len++;
            id++;
        }
        if(len>maxlen)
        {
            maxlen = len;
            maxsum=sum;
        }
    }
    for(long long del=2; del<maxsum; del++)
    {
        if(maxsum%del==0)
        {
            if(del>maxdel)
            {
                maxdel=del;
            }
        }

    }
    cout<<maxlen<<"\n"<<maxdel<<"\n";

    return 0;
}
