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