#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

#define N 5001

int a[N],f[N];

void read(int &x)

{

    x=; char c=getchar();

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) { x=x*+c-''; c=getchar(); }

}

struct node

{

    int len;

    int num[];

    node()

    {

        len=;

        memset(num,,sizeof(num));

    }

    void operator = (int a)

    {

        len=;

        num[]=a;

    }

    void operator += (node p)

    {

        len=max(len,p.len);

        for(int i=;i<=len;++i) num[i]+=p.num[i];

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

            if(num[i]>=)

            {

                num[i]-=;

                num[i+]++;

            }

        if(num[len+]) len++;

    }

    void print()

    {

        for(int i=len;i;--i) cout<<num[i];

    }

}s[N],sum;

int main()

{

    int n;

    read(n);

    for(int i=;i<=n;++i) read(a[i]);

    int max_len=;

    a[]=1e9;

    s[]=;

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

    {

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

            if(a[j]>a[i] && f[j]>f[i]) f[i]=f[j];

        f[i]++;

        max_len=max(max_len,f[i]);

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

            if(f[j]+==f[i] && a[j]>a[i]) s[i]+=s[j];

            else if(f[i]==f[j] && a[i]==a[j]) break;

    }

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

        if(f[i]==max_len) sum+=s[i];

    cout<<max_len<<' ';

    sum.print();

}