#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=405;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=998244353;
const int INF=1000000010;
const ll MAX=1000000000000;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int a[N],f[N];
int tot,u[2*N],v[N*N],cap[N*N],flow[N*N],pre[N*N];
void add(int a,int b,int c,int f) {
v[tot]=b;cap[tot]=c;flow[tot]=f;pre[tot]=u[a];u[a]=tot++;
}
bool q[2*N];
int d[2*N],dis[2*N],head[2*N];
bool bfs(int a,int b) {
int i,l=1,r=1;
memset(q,0,sizeof(q));
d[1]=a;q[a]=1;dis[a]=0;
for (;l<=r;l++)
for (i=u[d[l]];i!=-1;i=pre[i])
if (!q[v[i]]&&cap[i]>flow[i]) q[v[i]]=1,d[++r]=v[i],dis[v[i]]=dis[d[l]]+1;
return q[b];
}
int dfs(int a,int b,int en) {
if (a==en||b==0) return b;
int ret=0,f;
for (int& i=u[a];i!=-1;i=pre[i])
if (dis[v[i]]==dis[a]+1&&(f=dfs(v[i],min(b,cap[i]-flow[i]),en))>0) {
flow[i]+=f;flow[i^1]-=f;
ret+=f;b-=f;
if (b==0) break ;
}
return ret;
}
int main()
{
int i,j,n,k=0,ans=0;
scanf("%d", &n);
for (i=1;i<=n;i++) scanf("%d", &a[i]);
for (i=1;i<=n;i++) {
f[i]=1;
for (j=1;j<i;j++)
if (a[i]>a[j]) f[i]=max(f[i],f[j]+1);
k=max(k,f[i]);
}
printf("%d\n", k);
tot=0;memset(u,-1,sizeof(u));
for (i=1;i<=n;i++) add(i,i+n,1,0),add(i+n,i,0,0);
for (i=1;i<=n;i++) {
if (f[i]==1) add(0,i,INF,0),add(i,0,0,0);
if (f[i]==k) add(i+n,2*n+1,INF,0),add(2*n+1,i+n,0,0);
}
for (i=1;i<=n;i++)
for (j=i+1;j<=n;j++)
if (f[j]==f[i]+1&&a[j]>a[i]) add(i+n,j,1,0),add(j,i+n,0,0);
for (i=0;i<=2*n+1;i++) head[i]=u[i];
while (bfs(0,2*n+1)) {
ans+=dfs(0,INF,2*n+1);
for (i=0;i<=2*n+1;i++) u[i]=head[i];
}
printf("%d\n", ans);
if (k==1) printf("%d\n", n);
else {
for (i=1;i<=n;i++) add(i,i+n,INF,0),add(i+n,i,0,0);
while (bfs(0,2*n+1)) {
ans+=dfs(0,INF,2*n+1);
for (i=0;i<=2*n+1;i++) u[i]=head[i];
}
printf("%d\n", ans);
}
return 0;
}