#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
#include "onetwothree.h"

using namespace std;

void maximize (vector<int> A) {
    int n = isz(A);
    vector<vector<int>> pos(4);
    for (int i = 0; i < n; ++i) pos[A[i]].emplace_back(i);
    int max_ans = min({isz(pos[1]), isz(pos[2]), isz(pos[3])});
    
    vector<array<int, 3>> trace, res_trace;
    auto check = [&](int pfx1, int pfx3) -> bool {
        trace.clear();
        if (pfx1 + pfx3 > max_ans) return false;
        int l1 = 0, r1 = isz(pos[3]) - pfx1;
        int l3 = 0, r3 = isz(pos[1]) - pfx3;
        for (int pos2 : pos[2]) {
            if (l1 < pfx1 and pos2 > pos[3][r1]) return false; 
            if (l3 < pfx3 and pos2 > pos[1][r3]) return false;
            if (l3 == pfx3) {
                if (pos[1][l1] < pos2 and pos2 < pos[3][r1]) {
                    trace.push_back({pos[1][l1], pos2, pos[3][r1]});
                    ++l1, ++r1;
                }
            }
            else if (l1 == pfx1) {
                if (pos[3][l3] < pos2 and pos2 < pos[1][r3]) {
                    trace.push_back({pos[3][l3], pos2, pos[1][r3]});
                    ++l3, ++r3;
                }
            }
            else {
                bool choose1 = pos[1][l1] < pos2 and pos2 < pos[3][r1];
                bool choose3 = pos[3][l3] < pos2 and pos2 < pos[1][r3];
                if (choose1 and choose3) {
                    if (pos[3][r1] < pos[1][r3]) {
                        trace.push_back({pos[1][l1], pos2, pos[3][r1]});
                        ++l1, ++r1;
                    }
                    else {
                        trace.push_back({pos[3][l3], pos2, pos[1][r3]});
                        ++l3, ++r3;
                    }
                }
                else if (choose1) {
                    trace.push_back({pos[1][l1], pos2, pos[3][r1]});
                    ++l1, ++r1;
                }
                else if (choose3) {
                    trace.push_back({pos[3][l3], pos2, pos[1][r3]});
                    ++l3, ++r3;
                }
            }
            // cout << l1 << " " << l3 << endl;
            if (l1 == pfx1 and l3 == pfx3) return true;
        }
        if (l1 == pfx1 and l3 == pfx3) return true;
        return false;
    };

    if (max_ans) {
        if (check(1, 0)) res_trace = trace;
    }

    int pfx3 = max_ans;
    for (int pfx1 = 0; pfx1 <= max_ans; ++pfx1) {
        while (pfx3 >= 0 and not check(pfx1, pfx3)) --pfx3;
        if (isz(trace) > isz(res_trace)) res_trace.swap(trace);
    }

    for (auto [x, y, z] : res_trace) answer(x, y, z);
}