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

void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a.rbegin(), a.rend());
	vector<int> ans;
	const int inf = 1e9;
	auto dfs = [&](auto self, int x, int sum) {
		if (sum == inf) return true;
		if (x == n || sum > inf) return false;
		if (sum + a[x] <= inf) {
			ans.push_back(x);
			auto val = self(self, x + 1, sum + a[x]);
			if (val == true) return true;
			ans.pop_back();
		}
		auto val = self(self, x + 1, sum);
		return val;
	};
	dfs(dfs, 0, 0);
	cout << ans.size() << " ";
	for (auto i : ans) cout << i + 1 << " ";
	cout << "\n";
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	solve();
	return 0;
}