#include <iostream>
#include <set>
using namespace std;
set <int> S[2][40005];
int V;
int j,k,ok,col,tmp,N,i;
int main()
{
    cin>>N;
    for(i=1;i<=N;i++)
    {
        cin>>V;
        V%=N;
        if(S[i%2][V].empty())
            S[(i+1)%2][V].insert(i);
        for(j=0;j<N;j++)
        {
            if(j<V)
            {
                if(!S[i%2][j-V+N].empty())
                    if(S[i%2][j].empty())
                    {
                        for(set<int> ::iterator it=S[i%2][j-V+N].begin();it!=S[i%2][j-V+N].end();it++)
                            S[(i+1)%2][j].insert(*it);
                        S[(i+1)%2][j].insert(i);
                    }
            }
            else if(j>V)
            {
                if(!S[i%2][j-V].empty())
                    if(S[i%2][j].empty())
                    {
                        for(set<int> ::iterator it=S[i%2][j-V].begin();it!=S[i%2][j-V].end();it++)
                            S[(i+1)%2][j].insert(*it);
                        S[(i+1)%2][j].insert(i);
                    }
            }
        }
        if(!S[(i+1)%2][0].empty())
            break;
    }
    cout<<S[(i+1)%2][0].size()<<"\n";
    for(set<int>::iterator it=S[(i+1)%2][0].begin();it!=S[(i+1)%2][0].end();it++)
        cout<<*it<<" ";
    return 0;
}