#include <bits/stdc++.h>   const int INF = 1 << 29;   int main() {     std::ios_base::sync_with_stdio(false);     std::cin.tie(NULL);     ;     int n;     std::cin >> n;     std::vector<int> v(n);     for (int &it : v) std::cin >> it;     int alice = v[0];     int sum = std::accumulate(v.begin(), v.end(), 0);     int target = sum / 2 + 1;     std::vector<int> ans;     ans.push_back(1);     int cur = alice;     for (int i = 0; i < n; i++) {       if (alice < v[i] * 2) continue;       cur += v[i];       ans.push_back(i + 1);       if (cur >= target) break;     }     if (cur < target) {       std::cout << 0;       exit(0);     } else {       std::cout << ans.size() <<   n ;       for (int it : ans) std::cout << it <<    ;     }     return 0;   }   