#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
    T x;         \
    cin >> x;
#define AIN(T, a, n) \
    vector<T> a(n);  \
    FOR(i, a)        \
    cin >> i;
#define A2IN(T1, a, T2, b, n) \
    vector<T1> a(n);          \
    vector<T2> b(n);          \
    REP(i, n)                 \
    cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template

ll D;
vi c;
vvi s;

ll value(vi t)
{
    ll S = 0;
    vi last(26);
    REP(i, t.size())
    {
        ll k = t[i];
        last[k] = i + 1;
        S += s[i][k];
        REP(j, 26)
        {
            S -= c[j] * (i + 1 - last[j]);
        }
    }
    return S;
}

int main()
{
    ll t_begin = clock();
    cin >> D;
    c.resize(26);
    REP(i, 26)
    {
        cin >> c[i];
    }
    s.assign(D, vi(26));
    REP(i, D)
    {
        REP(j, 26)
        {
            cin >> s[i][j];
        }
    }

    vi t;
    REP(i, D)
    {
        ii opt = {0, 0};
        REP(j, 26)
        {
            t.push_back(j);
            ll res = value(t);
            t.pop_back();
            if (res > opt.first)
            {
                opt = {res, j};
            }
        }
        t.push_back(opt.second);
    }
    ll opt = value(t);
    while (1. * (clock() - t_begin) / CLOCKS_PER_SEC < 1.8)
    {
        REP(i, D)
        {
            REP(j, 26)
            {
                ll old = t[i];
                t[i] = j;
                ll res = value(t);
                if (res < opt)
                {
                    t[i] = old;
                }
                else
                {
                    opt = res;
                }
            }
        }
    }
    FOR(x, t)
    {
        OUT(x + 1);
    }
}

Measured memory_bytes: 3808