#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const long long inf = (long long)1e16;
const long double eps = 1e-12;
const long long N = (int)1e5 + 5;
const long long LOGN = 19;
const long double PI = 3.14159265358979323846;
inline long long mul(long long a, long long b, long long m = mod) {
  return (long long)(a * b) % m;
}
inline long long add(long long a, long long b, long long m = mod) {
  a += b;
  if (a >= m) a -= m;
  if (a < 0) a += m;
  return a;
}
inline long long power(long long a, long long b, long long m = mod) {
  if (b == 0) return 1;
  if (b == 1) return (a % m);
  long long x = power(a, b / 2, m);
  x = mul(x, x, m);
  if (b % 2) x = mul(x, a, m);
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (0) {
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\input.txt", "r",
            stdin);
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\output.txt", "w",
            stdout);
  }
  int n;
  cin >> n;
  if (n < 3) {
    cout << 0;
    return 0;
  }
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int dp[n][2];
  memset(dp, -1, sizeof(dp));
  int mx = a[n - 1], id = n - 1;
  for (int i = n - 2; i >= 0; i--) {
    if (a[i] < mx)
      dp[i][0] = id;
    else {
      mx = a[i];
      id = i;
    }
  }
  mx = a[0], id = 0;
  for (int i = 1; i <= n - 1; i++) {
    if (a[i] < mx)
      dp[i][1] = id;
    else {
      mx = a[i];
      id = i;
    }
  }
  for (int i = 1; i <= n - 2; i++) {
    if (dp[i][0] != -1 && dp[i][1] != -1) {
      cout << "3\n";
      cout << dp[i][1] + 1 << ' ' << i + 1 << ' ' << dp[i][0] + 1;
      return 0;
    }
  }
  memset(dp, -1, sizeof(dp));
  int mn = a[n - 1];
  id = n - 1;
  for (int i = n - 2; i >= 0; i--) {
    if (a[i] > mn)
      dp[i][0] = id;
    else {
      mn = a[i];
      id = i;
    }
  }
  mn = a[0], id = 0;
  for (int i = 1; i <= n - 1; i++) {
    if (a[i] > mn)
      dp[i][1] = id;
    else {
      mn = a[i];
      id = i;
    }
  }
  for (int i = 1; i <= n - 2; i++) {
    if (dp[i][0] != -1 && dp[i][1] != -1) {
      cout << "3\n";
      cout << dp[i][1] + 1 << ' ' << i + 1 << ' ' << dp[i][0] + 1;
      return 0;
    }
  }
  cout << 0;
  return 0;
}
