#include <bits/stdc++.h>
using namespace std;

#define ll long long

int n, a[110];
struct node
{
    ll val;
    string from;
    bool operator<(node x) const
    {
        return val > x.val;
    }
    node() {}
    node(ll a, string s) : val(a), from(s) {}
};

set<int> se;
vector<string> v;
priority_queue<node> q;
priority_queue<node> 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())
        {
            auto tis = q.top();
            q.pop();
            qq.emplace(tis);

            int nex = tis.val + a[i];
            if (se.count(nex) && nex > 1e9)
                continue;
            if (nex == 1e9)
            {
                // end
                string s = tis.from + " " + to_string(i);
                string t;
                stringstream io(s);
                while (io >> t)
                    v.emplace_back(t);
                cout << v.size() << " ";
                for (auto c : v)
                    cout << c << " ";
                return 0;
            }
            qq.emplace(nex, tis.from + " " + to_string(i));
            se.emplace(nex);
        }
        swap(qq, q);
    }
    return 0;
}