Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. A Preponderant Reunion

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputEast 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:

- There is a sequence of
*n*non-negative integers*p*_{1},*p*_{2}, ...,*p*_{n}in the beginning. It is ruled that each integer in this sequence should be non-negative at any time. - You can select two consecutive positive integers in this sequence,
*p*_{i}and*p*_{i + 1}(1 ≤*i*<*n*), and then decrease them by their minimum (i. e.*min*(*p*_{i},*p*_{i + 1})), the cost of this operation is equal to*min*(*p*_{i},*p*_{i + 1}). We call such operation as a descension. - 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·10^{5}).

The second line contains *n* space-separated integers *p*_{1}, *p*_{2}, ..., *p*_{n} (0 ≤ *p*_{i} ≤ 10^{9}, *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 *p*_{i} and *p*_{i + 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 , of which the cost is 1 + 1 = 2.

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

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/18/2021 20:52:43 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|