Problem: You are given an array a of length n that consists of zeros and ones.

You can perform the following operation multiple times. The operation consists of two steps: 

  1. Choose three integers 1 ≤ x < y < z ≤ n, that form an arithmetic progression (y - x = z - y). 
  2. Flip the values a_x, a_y, a_z (i.e. change 1 to 0, change 0 to 1). 



Determine if it is possible to make all elements of the array equal to zero. If yes, print the operations that lead the the all-zero state. Your solution should not contain more than (⌊ n/3 ⌋ + 12) operations. Here ⌊ q ⌋ denotes the number q rounded down. We can show that it is possible to make all elements equal to zero in no more than this number of operations whenever it is possible to do so at all.

Input

The first line contains a single integer n (3 ≤ n ≤ 10^5) — the length of the array.

The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 1) — the elements of the array.

Output

Print "YES" (without quotes) if the answer exists, otherwise print "NO" (without quotes). You can print each letter in any case (upper or lower).

If there is an answer, in the second line print an integer m (0 ≤ m ≤ (⌊ n/3 ⌋ + 12)) — the number of operations in your answer.

After that in (i + 2)-th line print the i-th operations — the integers x_i, y_i, z_i. You can print them in arbitrary order.

Examples

Input

5
1 1 0 1 1


Output

YES
2
1 3 5
2 3 4


Input

3
0 1 0


Output

NO

Note

In the first sample the shown output corresponds to the following solution: 

  * 1 1 0 1 1 (initial state); 
  * 0 1 1 1 0 (the flipped positions are the first, the third and the fifth elements); 
  * 0 0 0 0 0 (the flipped positions are the second, the third and the fourth elements). 



Other answers are also possible. In this test the number of operations should not exceed ⌊ 5/3 ⌋ + 12 = 1 + 12 = 13.

In the second sample the only available operation is to flip all the elements. This way it is only possible to obtain the arrays 0 1 0 and 1 0 1, but it is impossible to make all elements equal to zero.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
struct node {
  int i, j, k;
};
vector<node> ans;
void S(int i, int k) {
  if ((k - i) & 1) return;
  int j = (i + k) / 2;
  ans.push_back((node){i, j, k});
  a[i] ^= 1;
  a[j] ^= 1;
  a[k] ^= 1;
}
int tr(int l) { return a[l] * 4 + a[l + 1] * 2 + a[l + 2]; }
int find(int l) {
  int v = tr(l);
  if (v == 4) return l;
  if (v == 2) return l + 1;
  if (v == 1) return l + 2;
  return 0;
}
vector<int> q[10005];
map<vector<int>, int> mp;
void output() {
  printf("YES\n");
  printf("%d\n", ans.size());
  for (int i = (int)(0); i <= (int)(ans.size() - 1); i++)
    printf("%d %d %d\n", ans[i].i, ans[i].j, ans[i].k);
}
void solve_BF() {
  int h = 0, t = 1;
  q[1].resize(n + 1);
  vector<int> res;
  res.resize(n + 1);
  for (int i = (int)(1); i <= (int)(n); i++) res[i] = a[i];
  while (h != t) {
    ++h;
    for (int i = (int)(1); i <= (int)(n); i++)
      for (int j = (int)(i + 1); j <= (int)(n); j++) {
        int k = 2 * j - i;
        if (k > n) break;
        vector<int> nxt = q[h];
        nxt[i] ^= 1;
        nxt[j] ^= 1;
        nxt[k] ^= 1;
        if (mp.find(nxt) == mp.end()) {
          mp[nxt] = mp[q[h]] + 1;
          q[++t] = nxt;
        }
      }
  }
  if (mp.find(res) == mp.end()) {
    puts("NO");
    exit(0);
  }
  for (; mp[res];) {
    bool fl = 0;
    for (int i = (int)(1); i <= (int)(n); i++) {
      for (int j = (int)(i + 1); j <= (int)(n); j++) {
        int k = 2 * j - i;
        if (k > n) break;
        vector<int> nxt = res;
        nxt[i] ^= 1;
        nxt[j] ^= 1;
        nxt[k] ^= 1;
        if (mp[nxt] + 1 == mp[res]) {
          S(i, k), res = nxt;
          fl = 1;
          break;
        }
      }
      if (fl) break;
    }
  }
  output();
}
bool workL(int l) {
  int v = tr(l);
  if (v == 7) return S(l, l + 2), 1;
  if (v == 5) return S(l, l + 4), 1;
  if (v == 3) return S(l + 1, l + 3), 1;
  return v == 0;
}
bool workR(int r) {
  int v = tr(r - 2);
  if (v == 7) return S(r - 2, r), 1;
  if (v == 5) return S(r - 4, r), 1;
  if (v == 6) return S(r - 3, r - 1), 1;
  return v == 0;
}
void bao(int x) {
  if (x + 6 <= n)
    S(x, x + 6), S(x + 3, x + 5), S(x + 4, x + 6);
  else
    S(x - 6, x), S(x - 5, x - 3), S(x - 6, x - 4);
}
void solve_LARGE() {
  int l = 1, r = n;
  while (l + 8 <= r) {
    if (workL(l))
      l += 3;
    else if (workR(r))
      r -= 3;
    else if (tr(l) == 6 && tr(r - 2) == 3) {
      if ((r - l) & 1)
        S(l, r - 1), S(l + 1, r);
      else
        S(l, r), S(l + 1, r - 1);
      l += 3;
      r -= 3;
    } else if (find(l)) {
      int t = find(l);
      S(t, r);
      S(t, r - 1);
      l += 3;
    } else if (find(r - 2)) {
      int t = find(r - 2);
      S(l, t);
      S(l + 1, t);
      r -= 3;
    }
  }
  for (int i = l; i + 2 <= r; i++)
    if (a[i]) S(i, i + 2);
  if (a[r] && a[r - 1])
    S(r - 2, r), bao(r - 2);
  else if (a[r])
    bao(r);
  else if (a[r - 1])
    bao(r - 1);
  output();
}
int main() {
  scanf("%d", &n);
  for (int i = (int)(1); i <= (int)(n); i++) scanf("%d", &a[i]);
  if (n <= 12)
    solve_BF();
  else
    solve_LARGE();
  for (int i = (int)(1); i <= (int)(n); i++) assert(a[i] == 0);
  assert(ans.size() <= n / 3 + 12);
}