27_C. Unordered Subsequence
The sequence is called ordered if it is non-decreasing or non-increasing. For example, sequnces [3, 1, 1, 0] and [1, 2, 3, 100] are ordered, but the sequence [1, 3, 3, 1] is not. You are given a sequence of numbers. You are to find it's shortest subsequence which is not ordered.

A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 105). The second line contains n space-separated integers — the given sequence. All numbers in this sequence do not exceed 106 by absolute value.

Output

If the given sequence does not contain any unordered subsequences, output 0. Otherwise, output the length k of the shortest such subsequence. Then output k integers from the range [1..n] — indexes of the elements of this subsequence. If there are several solutions, output any of them.

Examples

Input

5
67 499 600 42 23


Output

3
1 3 5


Input

3
1 2 3


Output

0


Input

3
2 3 1


Output

3
1 2 3
```python
# https://codeforces.com/problemset/problem/27/C
n  = int(input())
a  = list(map(int, input().split()))
b  = []

for i, x in enumerate(a):
    if i == 0 or x!=b[-1][0]:
        b.append([x, i])
    
ind = []    
for i in range(len(b)-2):
    if (b[i][0] < b[i+1][0] and b[i+1][0] > b[i+2][0]) or (b[i][0] > b[i+1][0] and b[i+1][0] < b[i+2][0]):
        ind.extend([b[i][1], b[i+1][1], b[i+2][1]])
        break
        
if len(ind) > 0:
    print(3)
    print(' '.join([str(x+1) for x in ind]))
else:
    print(0)
```