#pragma GCC optimize(2)
#pragma GCC optimize(3,"ofast","inline")
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int n, a[110];
vector<int> v;
unordered_set<int> se;
unordered_map<int, int> from;
unordered_map<int, int> bel;
priority_queue<int, vector<int>, greater<int>> q;
priority_queue<int, vector<int>, greater<int>> qq;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    q.emplace(0);
    se.emplace(0);
    for (int i = 1; i <= n; ++i)
    {
        while (!q.empty())
        {
            int tis = q.top();
            q.pop();
            qq.emplace(tis);

            int nex = tis + a[i];
            if (se.count(nex) && nex > 1e9)
                continue;
            if (nex == 1e9)
            {
                // end
                int p = i;
                from[nex] = bel[tis];
                bel[nex] = i;
                while (p)
                {
                    v.emplace_back(p);
                    int tp = from[nex];
                    nex -= a[p];
                    p = tp;
                }
                sort(v.begin(), v.end());
                cout << v.size() << " ";
                for (auto c : v)
                    cout << c << " ";
                return 0;
            }
            from[nex] = bel[tis];
            bel[nex] = i;
            qq.emplace(nex);
            se.emplace(nex);
        }
        swap(qq, q);
    }
    return 0;
}