#include <bits/stdc++.h>
using namespace std;
int k, n;
struct node {
  int num;
  int l;
} a[15];
bool cmp(node k1, node k2) { return k1.l < k2.l; }
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i].l, a[i].num = i;
  if (n == 1 || (n == 2 && a[1].l == a[2].l)) {
    cout << -1 << endl;
    return 0;
  }
  sort(a + 1, a + n + 1, cmp);
  k = a[1].l;
  cout << n - 1 << endl;
  for (int i = 2; i <= n; ++i) cout << a[i].num << " ";
  cout << endl;
  return 0;
}
