#include<cstdio>
#include<algorithm>
using namespace std;
int n,f[5100],len=0,cnt=0,A[5100],g[5100]={0};
int i,j;
int main() {
	freopen("djgm.in","r",stdin);
	freopen("djgm.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; i++)
        scanf("%d",&A[i]);
    for(i=1;i<=n;i++){
        f[i]=1;
        for(j=1;j<i;j++)
            if(A[j]>A[i])
                f[i]=max(f[i],f[j]+1);
        len=max(len,f[i]);
    }
    for(i=1;i<=n;i++) {
        if(f[i]==1)g[i]=1;
        for(j=1;j<i;j++)
            if(f[i]==f[j]+1&&A[i]<A[j])g[i]+=g[j];
            else if(f[i]==f[j]&&A[i]==A[j])g[i]=0;
        if(f[i]==len)cnt+=g[i];
    }
    printf("%d%d\n",len,cnt);
    return 0;
}