Problem: East or west, home is best. That's why family reunion, the indispensable necessity of Lunar New Year celebration, is put in such a position.

After the reunion dinner, Little Tommy plays a game with the family. Here is a concise introduction to this game: 

  1. There is a sequence of n non-negative integers p1, p2, ..., pn in the beginning. It is ruled that each integer in this sequence should be non-negative at any time. 
  2. You can select two consecutive positive integers in this sequence, pi and pi + 1 (1 ≤ i < n), and then decrease them by their minimum (i. e. min(pi, pi + 1)), the cost of this operation is equal to min(pi, pi + 1). We call such operation as a descension. 
  3. The game immediately ends when there are no two consecutive positive integers. Your task is to end the game so that the total cost of your operations is as small as possible. 



Obviously, every game ends after at most n - 1 descensions. Please share your solution of this game with the lowest cost.

Input

The first line contains one integer n (1 ≤ n ≤ 3·105).

The second line contains n space-separated integers p1, p2, ..., pn (0 ≤ pi ≤ 109, i = 1, 2, ..., n).

Output

In the first line print one integer as the number of descensions m (0 ≤ m ≤ n - 1).

In the next m lines print the descensions chronologically. More precisely, in each line of the next m lines print one integer i (1 ≤ i < n) representing a descension would operate on pi and pi + 1 such that all the descensions could be utilized from top to bottom.

If there are many possible solutions to reach the minimal cost, print any of them.

Examples

Input

4
2 1 3 1


Output

2
1
3


Input

5
2 2 1 3 1


Output

3
2
1
4

Note

In the first sample, one possible best solution is <image>, of which the cost is 1 + 1 = 2.

In the second sample, one possible best solution is <image>, of which the cost is 1 + 1 + 1 = 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 301000;
map<int, long long> dp[N];
map<int, pair<int, int> > pre[N], way[N];
int n, a[N];
pair<int, int> cur;
vector<int> ret, ret2;
void upd(int p, int v, long long cost, pair<int, int> ww) {
  if (!dp[p].count(v) || cost < dp[p][v]) {
    dp[p][v] = cost;
    way[p][v] = ww;
    pre[p][v] = cur;
  }
}
void dfs(int n, int v) {
  if (n == 1) return;
  if (way[n][v].first != -1) ret.push_back(way[n][v].first);
  if (way[n][v].second != -1) ret.push_back(way[n][v].second);
  dfs(pre[n][v].first, pre[n][v].second);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n + 1; i++) scanf("%d", a + i);
  for (int i = 1; i < n + 1; i++) dp[i].clear(), pre[i].clear(), way[i].clear();
  dp[1][a[1]] = 0;
  for (int i = 1; i < n; i++) {
    long long mv = 1ll << 60;
    for (auto p : dp[i]) {
      int v = p.first;
      long long w = p.second;
      if (w >= mv) continue;
      mv = w;
      cur = make_pair(i, v);
      if (v == 0) upd(i + 1, a[i + 1], w, make_pair(-1, -1));
      upd(i + 1, max(a[i + 1] - v, 0), w + min(v, a[i + 1]), make_pair(i, -1));
      if (i + 2 <= n && a[i + 1] <= a[i + 2])
        upd(i + 2, a[i + 2] - a[i + 1], w + a[i + 1], make_pair(i + 1, -1));
      if (i + 2 <= n && a[i + 1] >= a[i + 2])
        upd(i + 2, 0, w + a[i + 2] + min(v, (a[i + 1] - a[i + 2])),
            make_pair(i, i + 1));
    }
  }
  int mv = -1;
  long long w = 1ll << 60;
  for (auto p : dp[n])
    if (p.second < w) w = p.second, mv = p.first;
  dfs(n, mv);
  reverse((ret).begin(), (ret).end());
  for (auto p : ret) {
    if (a[p] > 0 && a[p + 1] > 0) {
      int z = min(a[p], a[p + 1]);
      a[p] -= z;
      a[p + 1] -= z;
      ret2.push_back(p);
    }
  }
  printf("%d\n", ((int)(ret2).size()));
  for (auto p : ret2) printf("%d ", p);
  puts("");
}