#include<bits/stdc++.h>

using namespace std;

const int N = 1e2 + 5, M = 1e6;
int n, a[N], f[N][M];
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    for(int i = 1; i <= n; i++) {
        a[i] %= M;
    }

    f[0][0] = -1;
    for(int i = 1; i < n; i++) {
        for(int j = 0; j < M; j++) {
            int k = (j - a[i] + M) % M;
            if(f[i - 1][k] != 0) {
                f[i][j] = i;
            } else if(f[i - 1][j] != 0) {
                f[i][j] = f[i - 1][j];
            }
        }
    }

    vector<int> ans;
    int j = 0;
    for(int i = n - 1; i >= 1; i--) {
        if(f[i][j] == i) {
            ans.push_back(i);
            j = (j - a[i] + M) % M;
        }
    }
    cout << ans.size() << ' ';
    sort(ans.begin(), ans.end());
    for(auto t : ans) {
        cout << t << ' ';
    }
    return 0;
}