#include <iostream>
using namespace std;
int a[100005],f1[100005],f2[100005];
int MAXN = 1e9;
int main() {
    int n = 0,i = 1;
    while(cin >> a[i]) {
        n ++;
        i ++;
    }
    for(int i = 1; i <= n ; i ++) {
        f1[i] = 1;
        for(int j = 1; j <= i - 1; j ++) {
            if(a[j] >= a[i])
            f1[i] = max(f1[i],f1[j] + 1);
        }
    }
    int ans = -MAXN;
    for(int i = 1; i <= n ;i ++) {
        if(ans < f1[i]) ans = f1[i];
    } 
    cout << ans << endl;
    // 可爱的分隔线 ~
    for(int i = 1; i <= n ; i ++) {
        for(int j = 1; j <= i - 1; j ++) {
            if(a[j] < a[i])
            f2[i] = max(f2[i],f2[j] + 1);
        }
    }
    ans = -MAXN;
    for(int i = 1; i <= n ;i ++) {
        if(ans < f2[i]) ans = f2[i];
    } 
    cout << ans + 1;
    return 0;
}

回复踹我~