#include <iostream>

#include <string.h>

#include <cstdio>

using namespace std;

const int size = ;

int maxlen[size];//记录当前第1个点到第i个点之间的最长下降序列长度

int maxnum[size];//记录1~i之间的最长下降序列个数

int main()

{

    //freopen("in.txt","r",stdin);

    int a[size];

    int n;

    while (scanf("%d", &n) != EOF){

          for (int i = ; i <= n; i ++){

              scanf("%d", &a[i]);

              maxnum[i] = ;

              maxlen[i] = ;

          }

          for (int i =  ; i <= n; i ++){

              for (int j = ; j < i; j ++){

                  if (a[i] < a[j]){

                     maxlen[i] = max(maxlen[i], maxlen[j]+);

                  }

              }

          }

          for (int i = ; i <= n; i ++)

              if (maxlen[i] == )maxnum[i] = ;

          for (int i = ; i <= n; i ++){

              for (int j = i-; j > ; j --){

                  if (a[j] > a[i]){

                     if (maxlen[j]+ == maxlen[i]){

                        maxnum[i] += maxnum[j];

                     }

                  }

                  if (a[j] == a[i]){

                     if (maxlen[i] == )maxnum[i] = ;//如果搜索到一个相同的数后仍没有找到符合要求的序列，则为了避免重复赋值为0

                     break;

                  }

              }

          }

          int maxx = -;

          for (int i = ; i <= n; i ++){

              if (maxlen[i] > maxx)  maxx = maxlen[i];

          }

          int ans = ;

          for (int i = ; i <= n; i ++){

              if (maxlen[i] == maxx) ans += maxnum[i] ;

          }

          printf("%d %d\n", maxx, ans);

    }

    return ;

}