#include <bits/stdc++.h>
using namespace std;
const int N = 2017;
bitset<N> f[N], nf, delta;
int g[N][N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n = 6666;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        // a[i] = rand() % 2016;
        a[i] %= 2016;
    }
    f[0][0] = 1;
    for (int pid = 0; pid < n; ++pid) {
        int x = a[pid];
        for (int i = 2016; i; --i) {
            nf = (f[i - 1] << x) | (f[i - 1] >> (2016 - x));
            delta = nf & (~f[i]);
            f[i] = nf;
            for (int j = delta._Find_first(); j < N; j = delta._Find_next(j)) g[i][j] = pid;
        }
        if (f[2016][0]) {
            int rm = 0;
            for (int j = 2016; j; --j) {
                int x = g[j][rm];
                rm = (rm - a[x] + 2016) % 2016;
                cout << x + 1 << '\n';
            }
            assert(rm == 0);
            return 0;
        }
    }    
    return 0;
}