#include <bits/stdc++.h>
using namespace std;
int p[100500];
int n;
int cmp(int a, int b) {
  if (a == b) return 0;
  if (a < b) return -1;
  return 1;
}
int main() {
  scanf("%d", &n);
  if (n < 3) {
    printf("0\n");
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", &p[i]);
  }
  int c = 0;
  for (int i = 0; i < n - 1; ++i) {
    int t = cmp(p[i], p[i + 1]);
    if (t == 0) continue;
    if (c == 0) {
      c = t;
      continue;
    }
    if (t != c) {
      printf("3\n");
      printf("%d %d %d\n", 0 + 1, i + 1, i + 1 + 1);
      return 0;
    }
  }
  printf("0\n");
  return 0;
}
