#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
int v[N];
int minleft[N], minright[N];
int n;
bool solve(int &p1, int &p2, int &p3) {
  minleft[1] = 1;
  for (int i = 2; i <= n; i++)
    minleft[i] = v[i] < v[minleft[i - 1]] ? i : minleft[i - 1];
  minright[n] = n;
  for (int i = n - 1; i >= 1; i--)
    minright[i] = v[i] < v[minright[i + 1]] ? i : minright[i + 1];
  for (int i = 2; i <= n - 1; i++)
    if (v[minleft[i - 1]] < v[i] && v[i] > v[minright[i + 1]]) {
      p1 = minleft[i - 1];
      p2 = i;
      p3 = minright[i + 1];
      return true;
    }
  return false;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
  int p1, p2, p3;
  if (solve(p1, p2, p3)) {
    printf("3\n%d %d %d\n", p1, p2, p3);
  } else {
    for (int i = 1; i <= n; i++) v[i] = -v[i];
    if (solve(p1, p2, p3)) {
      printf("3\n%d %d %d\n", p1, p2, p3);
    } else {
      printf("0\n");
    }
  }
}
