#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const long long LINF = 1e18;
void solve() {
  int n;
  cin >> n;
  vector<pair<int, int> > a(n);
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    a[i] = {x, i + 1};
  }
  sort(a.begin() + 1, a.end());
  long long s = 0;
  int ind = -1;
  for (int i = 0; i < n; ++i) {
    if (i && 2 * a[i].first > a[0].first) break;
    s += a[i].first;
    long long s1 = 0;
    for (int j = i + 1; j < n; ++j) {
      s1 += a[j].first;
    }
    if (s > s1) {
      ind = i;
      break;
    }
  }
  if (ind == -1) {
    cout << 0 << endl;
  } else {
    cout << 1 + ind << endl;
    cout << 1 << " ";
    for (int i = 1; i <= ind; ++i) {
      cout << a[i].second << " ";
    }
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) solve();
}
