#include <bits/stdc++.h>
#define int	long long
using namespace std;

const int N = 1e4;
int n;
int a[N];
int dp[N];
int p[100];
int ans = 0;
__int128 f[N];

void print(__int128 x)
{
    if(x < 0)
	{
        putchar('-');
        x = -x;
    }
    if(x > 9)
        print(x / 10);
    putchar(x % 10 + '0');
}
signed main()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	for(int i = 1; i <= n; i++)
	{
		f[i] = dp[i] = 1;
		for(int j = i - 1; j >= 1; j--)
		{
			if(a[i] < a[j])
			{
				if(dp[i] < dp[j] + 1) 
				{
					dp[i] = dp[j] + 1;
					f[i] = f[j];
				}
				else if(dp[i] == dp[j] + 1)
					f[i] += f[j];
			}
			else if(a[j] == a[i]) f[j] = 0;
		}
	}
	int maxn = *max_element(dp + 1, dp + n + 1);
	__int128 sum = 0;
	for(int i = 1; i <= n; i++)
	{
		if(dp[i] == maxn) sum += f[i];
	}
	cout << maxn << ' ';
	print(sum);
	return 0;
}