#include<bits/stdc++.h>

using i64 = long long;
using l64 = long double;

std::mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());
constexpr int S = 1e9;

void DAOQI() {
    int n;
    std::cin >> n;
    std::vector<i64> a(n + 1), p(n + 1);
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i];
        p[i] = i;
    }

    for (int i = 1; i <= 10000000; i++) {
        i64 sum = 0;
        for (int l = 1, r = 1; r <= n; r++) {
            sum += a[p[r]];
            while (sum > S) sum -= a[p[l++]];
            if (sum == S) {
                std::cout << r - l + 1 << " ";
                for (int k = l; k <= r; k++) std::cout << p[k] << " ";
                return;
            }
        }
        shuffle(p.begin() + 1, p.end(), rng);
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    //std::cin >> T;
    while (T--) DAOQI();
    return 0;
}