#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int inf = 1061109567;
const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
const int maxn = 1e5 + 5;
int a[maxn];
int main() {
  int n, maxx = 0, minn = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (i > 0 && maxx > minn && a[i] < a[maxx]) {
      printf("3\n%d %d %d", minn + 1, maxx + 1, i + 1);
      return 0;
    } else if (i > 0 && maxx < minn && a[i] > a[minn]) {
      printf("3\n%d %d %d", maxx + 1, minn + 1, i + 1);
      return 0;
    }
    if (a[maxx] < a[i]) maxx = i;
    if (a[minn] > a[i]) minn = i;
  }
  puts("0");
  return 0;
}
