#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000009

int dp[3000][3000][2];

int main(){
  int n;
  cin>>n;
  if(n==1){
    cout << 1 << endl;
    return 0;
  }
  vector<int> v;
  rep(i,0,n){
    int a;
    cin>>a;
    v.pb(a);
  }
  clr(dp,-1);
  rep(i,0,3000){
    dp[i][i][0] = 1;
    dp[i][i][1] = 1;
  }
  rep(i,2,n+1){
    rep(j,0,n-i+1){
      // left
      {
      int l = j+1;
      int r = j+i-1;
      if(dp[l][r][1]!=-1&&v[j]<v[r]){
        if(v[j]<v[r]){
          dp[l-1][r][0] = max(dp[l-1][r][0],dp[l][r][1]+1);
        }
        dp[l-1][r][1] = max(dp[l-1][r][1],dp[l][r][1]);
      }
      }
      // right
      {
      int l = j;
      int r = j+i-2;
      if(dp[l][r][0]!=-1){
        if(v[j+i-1]<v[l]){
          dp[l][r+1][1] =max(dp[l][r+1][1],dp[l][r][0]+1);
        }
        dp[l][r+1][0] = max(dp[l][r+1][0],dp[l][r][0]);
      }
      }
    }
  }
  int mx = 0;
  rep(i,0,n)rep(j,0,n)rep(k,0,2){
    mx = max(mx,dp[i][j][k]);
  }
  cout << dp[3][4][1] << endl;
  cout << mx << endl;
  return 0;
}