#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll d;
    cin >> d;
    vector<ll> z(26);
    for (int i = 0; i < 26; i++) {
        cin >> z[i];
    }
    vector<vector<ll>> x(d, vector<ll>(26));
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < 26; j++) {
            cin >> x[i][j];
        }
    }
    vector<ll> ans(d,1);
    vector<ll> f(26);
    for (int j = 0; j < d; j++) {
        ll mx = 0;
        ll atai = 0;
        for (int k = 0; k < 26; k++) {
            mx = max(x[j][k], mx);
            if (mx == x[j][k])atai = k;
        }
        ans[j] = atai + 1;
        for (int k = 0; k < 26; k++) {
            f[k]++;
            if (f[k]*z[k]>f[ans[j]-1]* z[ans[j] - 1] && f[k] * z[k] > 2000 && x[j][k] > 19000) {
                ans[j] = k + 1;
                break;
            }
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 2000 && x[j][k] > 17000)ans[j] = k + 1;
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 3000 && x[j][k] > 17000) {
                ans[j] = k + 1;
                break;
            }
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 3000 && x[j][k] > 13000)ans[j] = k + 1;
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 4000 && x[j][k] > 12000)ans[j] = k + 1;
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 4000 && x[j][k] > 15000) {
                ans[j] = k + 1;
                break;
            }
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 5000 && x[j][k] > 13000) {
                ans[j] = k + 1;
                break;
            }
            if (f[k] * z[k] > f[ans[j] - 1] * z[ans[j] - 1] && f[k] * z[k] > 8000) {
                ans[j] = k + 1;
                break;
            }
        }
        f[ans[j] - 1] = 0;
    }
    for (int i = 0; i < d; i++) {
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 3736