#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP make_pair

#include "onetwothree.h"
namespace {
    vector <ll> a[4];

    struct pt{
        ll i,j,k;
    };
    bool solve(ll a13,ll a31){
        if (a13 + a31 > min({sz(a[1]),sz(a[2]),sz(a[3])}))return 0;
        deque <ll> L1,L3,R1,R3;
        ll ptrL1,ptrL3,ptrR1,ptrR3;
        ptrL1 = ptrL3 = ptrR1 = ptrR3 = 0;
        ll res = 0;
        for (auto x:a[2]){
            while (ptrL1 < a13 && a[1][ptrL1] < x)ptrL1++;
            while (ptrL3 < a31 && a[3][ptrL3] < x)ptrL3++;
            if (ptrL1 == ptrR3){
                if (ptrL3==ptrR1){
                }
                else{
                    if (a[1][sz(a[1]) - a31 + ptrR1] < x)return 0;
                    res++;
                    ptrR1++;
                }
            }
            else{
                if (ptrL3==ptrR1){
                    if (a[3][sz(a[3]) - a13 + ptrR3] < x)return 0;
                    res++;
                    ptrR3++;
                }
                else{
                    if (a[1][sz(a[1]) - a31 + ptrR1] < a[3][sz(a[3]) - a13 + ptrR3]){
                        if (a[1][sz(a[1]) - a31 + ptrR1] < x)return 0;
                        res++;
                        ptrR1++;
                    }
                    else{
                        if (a[3][sz(a[3]) - a13 + ptrR3] < x)return 0;
                        res++;
                        ptrR3++;
                    }

                }
            }
        }
        return (res == a13+a31);
    }
    void trace(ll a13,ll a31){
        if (a13 + a31 > min(sz(a[1]),sz(a[3])))return;
        vector <pll> b;
        for (ll j = 0;j < a13;j ++){
            ll k = sz(a[3]) - a13 + j;
            b.push_back({a[1][j],a[3][k]});
        }
        for (ll j = 0;j < a31;j ++){
            ll k = sz(a[1]) - a31 + j;
            b.push_back({a[3][j],a[1][k]});
        }
        sort(b.begin(),b.end(),[](pll x,pll y){return x.se<y.se;});
        set <ll> s;
        for (auto x:a[2])s.insert(x);
        for (auto x:b){
            auto tmp = s.lower_bound(x.fi);
            answer(x.fi,*tmp,x.se);
            s.erase(tmp);
        }
    }
    ll n;
}
void maximize (std::vector<int> A) {
    n = sz(A);
    for (ll i = 0;i < n;i ++){
        a[A[i]].push_back(i);
    }
    ll a31 = 0;
    while (solve(0,a31+1))a31++;
    ll ans_a13,ans_a31;
    ans_a13 = 0,ans_a31 = 0;
    for (ll a13 = 0;a13 <= min(sz(a[1]),sz(a[2]));a13++){
        while (a31 > 0 && !solve(a13,a31))a31--;
        if (solve(a13,a31)){
            if (a13 + a31 > ans_a13 + ans_a31){}
            ans_a13 = a13,ans_a31 = a31;
        }
    }
    trace(ans_a13,ans_a31);
}