#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5, INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int n, A[maxn];
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  long long sum = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> A[i];
    sum += A[i];
  }
  ans.push_back(1);
  int i = 2;
  int now = A[1];
  while (now <= sum / 2 && i <= n) {
    if (A[1] >= A[i] * 2 && i <= n) {
      ans.push_back(i);
      now += A[i];
    }
    ++i;
  }
  int length = ans.size();
  if (now > sum / 2) {
    cout << length << endl;
    for (int i = 0; i <= length - 1; ++i) cout << ans[i] << " ";
  } else
    cout << 0 << endl;
  return 0;
}
