#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <list>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define LL long long
#define ULL unsigned long long
#define PI (atan(1) * 4)
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');
#define step(i) (i & (i - 1)) ^ i

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

bool AreEqual(double a, double b) {
	return (fabs(a - b) < 1e-10);
}

template <class T>
bool GetNr(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		if (ch == -1) {
			return false;
		}
		ch == '-' ? _sign = -1 : _sign = 1 ;
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
	return true;
}

vector <int> number, step, positions;
set <int> not_found;

int N;

int main(){
	string fileInput = "sum";
#ifdef INFOARENA
	freopen((fileInput + ".in").c_str(), "r", stdin);
	freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
		//	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/result", "w", stdout);
#endif
#endif
	
	int i;
	LL x;
	GetNr(N);
	number.resize(1 + N);
	step.resize(1 + N);
	positions.resize(1 + N);
	
	number[0] = 1;
	step[0] = 0;
	
	for (i = 1; i <= N; ++i) {
		not_found.insert(i);
	}
	
	
	
	for (i = 0; i < N; ++i) {
		vector <int> erase;
		GetNr(x);
		int original = x;
		x %= N;
		if (x == 0) {
			cout << 1 << '\n' << i + 1 << '\n';
			return 0;
		}
		
		for (auto it: not_found) {
			int y = it;
			if (y - x >= 0 && positions[y - x] != i + 1) {
				if (number[y - x] == 1) {
					number[y] = 1;
					step[y] = original;
					positions[y] = i + 1;
					erase.pb(y);
				}
			}
		}
		
		for (auto x: erase) {
			not_found.erase(x);
		}
		
		if (number[N] == 1) {
			break;
		}
	}
	
	vector <int> ans;
	i = N;
	while (i) {
		ans.pb(positions[i]);
		i = i - step[i] % N;
	}
	
	printf("%d\n", ans.size());
	for (auto x: ans) {
		cout << x << ' ';
	}
	ENTER
	
	
	
	return 0;
}