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

#define N 150

int A[N], Id[N], vis[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> A[i];
    iota(Id, Id + n + 1, 0);
    sort(Id, Id + n, [&](int a, int b) {
    	return (A[a] < A[b]);
    });
    fill(vis, vis + n + 5, 0);
    int s = 0, m = min(n, 26);
    for (int i = n - 1; i >= m; i--) {
    	int u = Id[i];
    	if (s > 0) {
    		vis[u] = 1;
    		s -= A[u];
    	}
    	else {
    		vis[u] = 0;
    		s += A[u];
    	}
    }
    int up = 1 << m;
    for (int i = 0; i < up; i++) {
    	int ss = s;
    	for (int j = 0; j < m; j++) {
    		int u = Id[j];
    		int t = ((i >> j) & 1);
    		vis[u] = t;
    		if (t) ss -= A[u];
    		else ss += A[u];
    	}
    	if (!ss) {
    		break;
    	}
    }
    vector<int> ans;
    for (int i = 0; i < n; i++) if (!vis[i]) {
    	s += A[i];
    	ans.push_back(i + 1);
    }
    cout << ans.size() << ' ';
    for (auto e : ans) cout << e << ' ';
    cout << endl;
    
    return 0;
}