/*
ZADATAK: sifra
JEZIK: c++
*/
#include <stdio.h>
#define MaxN 6005

int a [MaxN], pom [MaxN], p [MaxN], n, num, d, m;
FILE *in, *out;

         void QSort (int l, int r)
         {
                    int i, j, pivot, tmp;
                    if (l < r)
                    {
                             pivot = pom [(l + r) / 2];
                             i = l; j = r;
                             do
                             {
                                 while (pom [i] < pivot) i++;
                                 while (pom [j] > pivot) j--;
                                     if (i <= j)
                                     {
                                            tmp = pom [i]; pom [i] = pom [j]; pom [j] = tmp;
                                            i++; j--;
                                     }
                         }
                         while (i <= j);
                         QSort (i, r);
                         QSort (l, j);
                    }
         }

         int main ()
         {
                 int i, j, min, max;

                 in = fopen ("sifra.in", "r");
                 out = fopen ("sifra.out", "w");
                 fscanf (in, "%d", &n);
                 for (i = 1; i <= n; i++)
                 {
                         fscanf (in, "%d", &a [i]);
                         pom [i] = a [i];
                 }
                 QSort (1, n);
                 i = 1; m = 0;
                 while (i <= n)
                 {
                            m++;
                            pom [m] = pom [i];
                            while ((i <= n) && (pom [m] == pom [i]))
                                        i++;
                 }
                 for (i = 1; i <= n; i++)
                 {
                         p [i] = 1;
                         while (pom [p [i]] != a [i])
                                     p [i]++;
                 }
                 num = d = 0;
                 for (i = 1; i <= n; i++)
                 {
                         for (j = 1; j <= n; j++)
                                 pom [j] = 0;
                       max = -1; min = 2000000000;
                         for (j = i; j >= 1; j--)
                         {
                                 pom [p [j]]++;
                                 if (pom [p [j]] == 2) break;
                                 if (a [j] > max) max = a [j];
                                 if (a [j] < min) min = a [j];
                                 if (max - min + 1 == i - j + 1)
                                 {
                                        if (i - j + 1 == d) num++;
                                        if (i - j + 1 > d)
                                        {
                                             num = 1;
                                             d = i - j + 1;
                                        }
                                    }
                     }
                 }

                 fprintf (out, "%d %d\n", d, num);

                 return 0;
         }