#include<iostream>
#include<cstdio>
#define int long long int
using namespace std;
int a[5001],dp[5001],jl[5001];
int n,ans1,ans2;
signed main()
{
	freopen("djgm.in","r",stdin);
	freopen("djgm.out","w",stdout);
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<i;j++)
		{
			if(a[j]>a[i])
			{
				dp[i]=max(dp[i],dp[j]+1);
			}
		}
		if(dp[i]==0)
		{
			dp[i]=1;
		}
		for(int j=1;j<i;j++)
		{
			if(dp[j]==dp[i]&&a[i]==a[j])
			{
				jl[j]=0;
			}
			if(dp[i]==dp[j]+1&&a[j]>a[i])
				jl[i]+=jl[j];
		} 
		if(jl[i]==0)
			jl[i]=1;
	}
	for(int i=1;i<=n;i++)
	{
		ans1=max(ans1,dp[i]);
	}
	for(int i=1;i<=n;i++)
	{
		if(dp[i]==ans1)
		{
			ans2+=jl[i];
		}	
	}
	cout<<ans1<<' '<<ans2<<endl;
	return 0;
}