#include<iostream>
#include<vector>
#include<algorithm>
#include<random>
#include<array>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
using ll = long long;
// const int inf = 0x3f3f3f3f3f3f3f3fLL;

const int mod = 1e5;

void solve() {
    int n; cin >> n;
    vector<int> ori(n + 1);
    vector<pair<int, int>> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> ori[i];
        a[i].first = ori[i] % mod;
        a[i].second = i;
    }

    if(n == 2) {
        cout << (ll) 1e9 << "\n";
        return ;
    }

    vector<int> ans;
    mt19937 rng(19260817);
    auto check = [&]() {
        shuffle(a.begin() + 1, a.end(), rng);
        vector dp(n + 1, vector<int> (mod + 1));
        vector fr(n + 1, vector<pair<int, int>>(mod + 1));
        ans.clear();
        int sum = 0;

        auto positive = [](int x) {
            int t = x % mod;
            if(t < 0) return t + mod;
            return t;
        };

        for(int i = 1; i <= n; i++) {
            for(int j = 0; j < mod; j++) {
                int last = positive(j - a[i].first);
                if(dp[i - 1][j]) {
                    dp[i][j] = dp[i - 1][j];
                    fr[i][j] = fr[i - 1][j];
                } else if(dp[i - 1][last]) {
                    dp[i][j] = dp[i - 1][last];
                    fr[i][j] = {i - 1, last};
                }
            }

            if(dp[i][0]) {
                ans.push_back(a[i].second);
                auto [ii, ij] = fr[i][0];
                while(pair(ii, ij) != pair(0LL, 0LL)) {
                    ans.push_back(a[ii].second);
                    int nii = fr[ii][ij].first, njj = fr[ii][ij].second;
                    ii = nii, ij = njj;
                }
                break;
            }
            dp[i][a[i].first] = 1;
        }

        for(auto i : ans) {
            sum += ori[i];
        }

        if(sum != (long long)1e9) {
            return false;
        }
        return true;
    };

    while(!check()) {
        continue;
    }

    cout << ans.size() << " ";
    for(auto i : ans) {
        cout << i << " ";
    }
    cout << "\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    while(T--) solve();
    return 0;
}

/*

10
386413329 88494216 245947398 316438989 192751270 204627269 65749456 3938400 150458676 345180997

*/