#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n,total_maximum;
vector <int> decimal_array;

void find_optimal_chain(int n)
{
    vector <int> chain_legth;
    int maximum=0;

    chain_legth.resize(n);

    for(int i=0;i<n;i++)
    {
        chain_legth[i]=1;
    }


    for(int i=n-2;i>=0;i--)
    {
        for(int j=i+1;j<n;j++)
        {
            if(decimal_array[i]<decimal_array[j]&&chain_legth[i]<chain_legth[j]+1)
            {
                chain_legth[i]=chain_legth[j]+1;

                if(chain_legth[i]>maximum)
                {
                    maximum=chain_legth[i];
                }
            }
        }
    }

    if(maximum>total_maximum)
    {
        total_maximum=maximum;
    }
}

int main()
{
    fin>>n;
    decimal_array.resize(n);

    for(int i=0;i<n;i++)
    {
        fin>>decimal_array[i];
    }

    find_optimal_chain(n);

    fout<<total_maximum<<endl<<0;
    return 0;
}