#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, arr[N];
pair<int, int> suff[N], pre[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  pre[0] = make_pair(arr[0], 0);
  for (int i = 1; i < n; i++) {
    if (arr[i] < pre[i - 1].first)
      pre[i] = make_pair(arr[i], i);
    else
      pre[i] = pre[i - 1];
  }
  suff[n - 1] = make_pair(arr[n - 1], n - 1);
  for (int i = n - 2; i >= 0; i--) {
    if (arr[i] < suff[i + 1].first)
      suff[i] = make_pair(arr[i], i);
    else
      suff[i] = suff[i + 1];
  }
  for (int i = 1; i < n - 1; i++) {
    if (arr[i] > pre[i - 1].first && arr[i] > suff[i + 1].first)
      return printf("3\n%d %d %d\n", pre[i - 1].second + 1, i + 1,
                    suff[i + 1].second + 1) *
             0;
  }
  for (int i = 1; i < n; i++) {
    if (arr[i] > pre[i - 1].first)
      pre[i] = make_pair(arr[i], i);
    else
      pre[i] = pre[i - 1];
  }
  suff[n - 1] = make_pair(arr[n - 1], n - 1);
  for (int i = n - 2; i >= 0; i--) {
    if (arr[i] > suff[i + 1].first)
      suff[i] = make_pair(arr[i], i);
    else
      suff[i] = suff[i + 1];
  }
  for (int i = 1; i < n - 1; i++) {
    if (arr[i] < pre[i - 1].first && arr[i] < suff[i + 1].first)
      return printf("3\n%d  %d %d\n", pre[i - 1].second + 1, i + 1,
                    suff[i + 1].second + 1) *
             0;
  }
  return printf("0") * 0;
}
