#include<bits/stdc++.h>

using namespace std;

const int N = 1e2 + 5, M = 1e5;
const long long S = 1e9;
int n, a[N];
pair<int, int> f[N][M * 2];
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    srand(time(0));

    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    // cout << a[1] + a[5] + a[6] + a[7] + a[9] << endl;

    while(1) {
        int m = rand() % 100000 + 100000;

        f[0][0] = {-1, 0};
        for(int i = 1; i <= n; i++) {
            for(int j = 0; j < M; j++) {
                int k = ((j - a[i]) % m + m) % m;
                if(f[i - 1][k].first != 0 && S * (i - 10) / n <= f[i - 1][k].second + a[i]
                                            && f[i - 1][k].second + a[i] <= min(S, S * (i + 10) / n)) {
                    f[i][j] = {i, f[i - 1][k].second + a[i]};
                } else if(f[i - 1][j].first != 0) {
                    f[i][j] = f[i - 1][j];
                } else {
                    f[i][j] = {0, 0};
                }
            }
        }

        vector<int> ans;
        int j = S % m;
        bool ok = 0;
        for(int i = n; i >= 1; i--) {
            if(f[i][S % m].second != S && !ok) continue;
            ok = 1;
            if(f[i][j].first == i) {
                ans.push_back(i);
                j = ((j - a[i]) % m + m) % m;
            }
        }
        if(!ok) continue;
        cout << ans.size() << ' ';
        sort(ans.begin(), ans.end());
        for(auto t : ans) {
            cout << t << ' ';
        }
        break;
    }
    return 0;
}