#include <bits/stdc++.h>
using namespace std;
int n,m,om,i,j,x,a[400400],b[400400],q[400400];
vector<int> r;
int md(int x) {
  if (x>n) return x-n;
  return x;
}
int main() {
  scanf("%d",&n);
  for (i=0; i<=n; i++) b[i]=-1;
  b[0]=0; q[0]=0; m=1;
  for (i=0; i<n; i++) {
    scanf("%d",&a[i]); om=m;
    for (j=0; j<om; j++) {
      x=md(q[j]+a[i]);
      if (b[x]==-1) { b[x]=i; q[m++]=x; }
      if (b[n]!=-1) break;
    }
    if (b[n]!=-1) break;
  }
  for (i=n; i!=0; i-=a[b[i]]) {
    if (i<0) i+=n;
    r.push_back(b[i]);
  }
  printf("%d\n",int(r.size()));
  for (i=0; i<r.size(); i++) printf("%d%c",r[i]+1,(i+1==r.size())?'\n':' ');
  return 0;
}