#include <bits/stdc++.h>
using namespace std;
const int N = 110;
pair<int, int> a[N];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", &a[i].first), a[i].second = i + 1;
  sort(a + 1, a + n);
  int Sum1 = a[0].first;
  int Sum2 = 0;
  for (int i = 1; i < n; i++) Sum2 += a[i].first;
  vector<int> Ans({1});
  for (int i = 1; i < n && Sum1 <= Sum2 && 2 * a[i].first <= a[0].first; i++) {
    Sum1 += a[i].first;
    Sum2 -= a[i].first;
    Ans.push_back(a[i].second);
  }
  if (Sum1 <= Sum2) return 0 * puts("0");
  sort(Ans.begin(), Ans.end());
  cout << Ans.size() << endl;
  for (int x : Ans) printf("%d ", x);
}
