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.
def ii():
    return int(input())
def li():
    return list(map(int,input().split()))
def si():
    return input()
def ti():
    return map(int,input().split())
def di():
    return deque((map(int,input().split())))
from bisect import bisect_left,bisect_right
from collections import deque,defaultdict
from math import *
def mod_inverse(a, m):
    m0 = m
    y = 0
    x = 1
    if m == 1:
        return 0
    while a > 1:
        q = a // m
        t = m
        m = a % m
        a = t
        t = y
        y = x - q * y
        x = t
    if x < 0:
        x = x + m0
    return x
def prefixsum(l,n):
    array=[l[0]]
    for i in range(1,n):
        array.append(array[-1]+l[i])
    return array
def suffixsum(l,n):
    array=[0]*n
    temperory=0
    for i in range(n):
        temperory+=l[n-1-i]
        array[n-1-i]=temperory
    return array
def prime(x):
    if x==1:
        return(0)
    elif x==2:
        return(1)
    else:
        t=(sqrt(x))+1
        t=int(t)
        for i in range(2,t):
            if x%i==0:
                return(0)
        else:
            return(1)
def prefixmax(l,n):
    array=[l[0]]
    for i in range(1,n):
        array.append(max(array[-1],l[i]))
    return array
def prefixmin(l,n):
    array=[l[0]]
    for i in range(1,n):
        array.append(min(array[-1],l[i]))
    return array
def BinarySearch(a, x):
 
    i = bisect_left(a, x)
 
    if i != len(a) and a[i] == x:
 
        return i
 
    else:
 
        return -1
def sortremoveDuplicates(arr, n):
    if n == 0 or n == 1:
        return arr
 
    temp = []
    j = 0
    for i in range(0, n-1):
        if arr[i] != arr[i+1]:
            temp += [arr[i]]
            j += 1
    temp += [arr[n-1]]
    return temp
def decimalToBinary(n):
    return bin(n).replace("0b", "")
def ato1(chr):
    return ord(chr)-ord("A")
def permutationindex(l,n):
    arr=[0]*(n)
    for i in range(n):
        arr[l[i]-1]=i
    return arr
def issubsequence(s1, s2):
 
    n, m = len(s1), len(s2)
    i, j = 0, 0
    while (i < n and j < m):
        if (s1[i] == s2[j]):
            i += 1
        j += 1
 
    # If i reaches end of s1,that mean we found all
    # characters of s1 in s2,
    # so s1 is subsequence of s2, else not
    return i == n
def def_value():
    return 0
def primef(n):
    l1=[]
    i=2
    while i*i<=n:
        if n%i!=0:
            i+=1
        else:
            l1.append(i)
            n//=i
    if n>1:
        l1.append(n)
    return l1
"""
def search( k) :
        global ans1
        if (k == len(l)) :
           if len(subset)%2==0 and len(subset)>0:
               ans1+=maxi//product(subset)
           elif len(subset)>0:
               ans1-=maxi//product(subset)
        else:
           search(k+1)
           subset.append(l[k])
           search(k+1)
           subset.pop()
"""
def seive(n):
    ans=[0]*(n+1)
    primes=[]
    for i in range(2,n+1):
        if ans[i]==0:
            primes.append(i)
            for j in range(2*i,n+1,i):
                ans[j]=i
    return ans
def inte(s1,s2):
    if s1[1]<s2[0] or s2[1]<s1[0]:
        return 0
    return [max(s1[0],s2[0]),min(s1[1],s2[1])]
def checksq(x):
    z=int(sqrt(x))
    if z*z==x:
        return True
    return False
def counti(l,n):
    l1=[]
    z=1
    for i in range(1,n):
        if l[i]==l[i-1]:
            z+=1
        else:
            l1.append([l[i-1],z])
            z=1
    l1.append([l[-1],z])
    return l1
import sys
input=sys.stdin.readline
n=ii()
l=li()
ld=l[::-1]
l1=prefixmin(l,n)
l2=prefixmin(ld,n)
l3=prefixmax(l,n)
l4=prefixmax(ld,n)
for i in range(1,n-1):
    if l1[i-1]<l[i] and l[i]>l2[n-i-2]:
        print(3)
        print(l.index(l1[i-1])+1,i+1,l.index(l2[n-i-2])+1)
        break
    elif l3[i-1]>l[i] and l[i]<l4[n-i-2]:
        print(3)
        print(l.index(l3[i-1])+1,i+1,l.index(l4[n-i-2])+1)
        break
else:
    print(0)
    