#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

mt19937 rng(time(NULL));

vector<pair<int,int>> el;
int sm,iter,target=1e9,iterlim=1e5;
vector<int> taken;
void dfs(int i){
	if(i==sz(el)){
		if(sm==target){
			printf("%i ",sz(taken));
			sort(all(taken));
			for(auto p:taken){
				printf("%i ",p);
			}
			printf("\n");
			exit(0);
		}
		return;
	}
	iter++;
	if(iter>iterlim){
		return;
	}
	if(sm+el[i].f<=target){
		sm+=el[i].f;
		taken.pb(el[i].s);
		dfs(i+1);
		sm-=el[i].f;
		taken.pop_back();
	}
	dfs(i+1);
}
int main()
{
	int n;
	cin >> n;
	for(int i=0;i<n;i++){
		int x;
		cin >> x;
		el.pb({x,i+1});
	}
	while(1){
		shuffle(all(el),rng);
		sm=iter=0;
		taken.clear();
		dfs(0);
	}
	return 0;
}