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.
The first line of the input contains one integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). The second line contains *n* space-separated integers — the given sequence. All numbers in this sequence do not exceed 10<sup class="upper-index">6</sup> by absolute value.
n=int(input())
A=list(map(int,input().split()))
minimal=A[0]
imin=0
maximal=A[0]
imax=0
i=1
d=False
while i<n and not d:
    if imax<imin<i and minimal<A[i]:
        print(3)
        D=[imin+1,imax+1,i+1]
        D.sort()
        
        print(' '.join(map(str,D)))
        d=True
    if imin<imax<i and maximal>A[i]:
        print(3)
        D=[imin+1,imax+1,i+1]
        D.sort()
        
        print(' '.join(map(str,D)))
        d=True
    if A[i]>maximal:
        maximal=A[i]
        imax=i
    if A[i]<minimal:
        minimal=A[i]
        imin=i
    i+=1
if not d: print(0)