#include <bits/stdc++.h>

#define all(x) begin(x), end(x)
#define each(i, x) for (auto& i : x)

using namespace std;

using ll = long long;
using db = long double;
using str = string;

using pi = pair<int, int>;
#define mp make_pair
#define f first
#define s second

#define ttt template <typename T
ttt > using vec = vector<T>;
ttt, size_t n > using arr = array<T, n>;
using vi = vec<int>;
using vb = vec<bool>;
using vl = vec<ll>;
using vpi = vec<pi>;
#define pb push_back
#define eb emplace_back

#define il inline
ttt > il int sz(const T& x) { return x.size(); }
ttt > il bool ckmin(T& x, const T& y) { return y < x ? x = y, true : false; }
ttt > il bool ckmax(T& x, const T& y) { return x < y ? x = y, true : false; }

constexpr int inf = 1e9;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false), cin.exceptions(cin.failbit);

  int n;
  cin >> n;

  vi a(n), pre(n + 1);
  arr<vi, 4> idx;
  for (int i = 0; i < n; ++i) {
    cin >> a[i], idx[a[i]].pb(i);
    pre[i + 1] = pre[i] + (a[i] == 2);
  }
  int c1 = sz(idx[1]), c3 = sz(idx[3]);
  vi sx(n, c1), sy(n, c3), tx(n, -1), ty(n, -1);
  for (int i = 0; i < c1; ++i) {
    fill(begin(sx) + (i ? idx[1][i - 1] + 1 : 0), begin(sx) + idx[1][i] + 1, i);
    fill(begin(ty) + idx[1][i], begin(ty) + (i < c1 - 1 ? idx[1][i + 1] : n),
         i);
  }
  for (int i = 0; i < c3; ++i) {
    fill(begin(sy) + (i ? idx[3][i - 1] + 1 : 0), begin(sy) + idx[3][i] + 1, i);
    fill(begin(tx) + idx[3][i], begin(tx) + (i < c3 - 1 ? idx[3][i + 1] : n),
         i);
  }
  int rx = min({c1, c3}), ry = rx, rxy = rx;
  for (int i = 0; i < c1; ++i) ckmin(rx, c3 + i - sy[idx[1][i]]);
  for (int i = 0; i < c3; ++i) ckmin(ry, c1 + i - sx[idx[3][i]]);
  int mxx = -inf, mxy = -inf, mxxy = -inf;
  for (int i = 0, j = 0; i < n; ++i) {
    int lim =
        min(tx[i] == -1 ? -1 : idx[3][tx[i]], ty[i] == -1 ? -1 : idx[1][ty[i]]);
    for (; j <= lim; ++j) {
      ckmax(mxx, pre[j] - sx[j]), ckmax(mxy, pre[j] - sy[j]);
      ckmax(mxxy, pre[j] - sx[j] - sy[j]);
    }
    ckmin(rx, pre[i + 1] - tx[i] - mxx + c3 - 1);
    ckmin(ry, pre[i + 1] - ty[i] - mxy + c1 - 1);
    ckmin(rxy, pre[i + 1] - tx[i] - ty[i] - mxxy + c1 + c3 - 2);
  }
  int ans_x, ans_y, ans = -inf;
  for (int x = 0; x <= rx; ++x) {
    int y = min(ry, rxy - x);
    if (ckmax(ans, x + y)) ans_x = x, ans_y = y;
  }
  cout << ans << "\n";
  int l1 = 0, r1 = 0, l3 = 0, r3 = 0;
  each (i, idx[2]) {
    while (r1 < ans_x && idx[1][r1] < i) ++r1;
    while (r3 < ans_y && idx[3][r3] < i) ++r3;
    int a = l1 < r1 ? idx[3][c3 - ans_x + l1] : n,
        b = l3 < r3 ? idx[1][c1 - ans_y + l3] : n;
    if (a == n && b == n) continue;
    if (a < b)
      cout << idx[1][l1++] << " " << i << " " << a << "\n";
    else
      cout << idx[3][l3++] << " " << i << " " << b << "\n";
  }
}