# include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define range_for(i, b, e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)
# define step(n) rep(_, n)
# define ALL(x) (x).begin(), (x).end()
# define RALL(x) (x).rbegin(), (x).rend()
# define Unique(a) a.erase(unique(ALL(a)), a.end())
# define pb push_back
# define len(x) ((int)(x).size())
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define debug(x) std::cerr<<#x<<": "<<(x)<<endl;
# define LINT_MAX (LLONG_MAX)
# define LINT_MIN (LLONG_MIN)
# define cauto const auto
//# define int long long
//# define float long double
using namespace std;
template <class Type> inline constexpr Type Square(Type x) { return x * x; }
template <class Type> inline constexpr bool InRange(const Type& x, const Type& i, const Type& a) { return (i <= x) && (x <= a); }
template<class Integer>bool chmax(Integer &a, const Integer &b) { if (a<b) { a=b; return 1; } return 0; }
template<class Integer>bool chmin(Integer &a, const Integer &b) { if (b<a) { a=b; return 1; } return 0; }
template<class Integer>bool IsOdd(Integer &n) { return n & 1; }
template<class Integer>bool IsEven(Integer &n) { return !(n & 1); }
long long gcd(long long a, long long b) { while(b){ long long A = a; (a = b), (b = A % b); } return a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int ctoi(const char c) { return ('0' <= c && c <= '9') ? (c - '0') : -1; }
string YesNo(bool b) { return b ? "Yes" : "No"; }
string YESNO(bool b) { return b ? "YES" : "NO"; }
string yesno(bool b) { return b ? "yes" : "no"; }
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
#define Cin(Type, ...) Type __VA_ARGS__; _cin(__VA_ARGS__)
#define Cinv(Type, xs, n) vector<Type> xs(n); rep(i, n) cin >> xs[i]
#define Cinv2(Type, xs, ys, n) vector<Type> xs(n), ys(n); rep(i, n) cin >> xs[i] >> ys[i]
#define Cinv3(Type, xs, ys, zs, n) vector<Type> xs(n), ys(n), zs(n); rep(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinvv(Type, xs, h, w) vector<vector<Type>> xs(h, vector<int>(w)); rep(i, h) rep(j, w) cin >> xs[i][j]
void Print() { cout << endl; }
template <class Head, class... Tail> void Print(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; Print(forward<Tail>(tail)...); }
template <class Type> void Print(vector<Type> &vec) { for (auto& a : vec) { cout << a; if (&a != &vec.back()) cout << " "; } cout << endl; }
template <class Type> void Print(vector<vector<Type>> &df) { for (auto& vec : df) { Print(vec); } }
void Debug() { cerr << endl; }
template <class Head, class... Tail> void Debug(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(tail) != 0) cerr << " "; Debug(forward<Tail>(tail)...); }
template <class Type> void Debug(vector<Type> &vec) { for (auto& a : vec) { cerr << a; if (&a != &vec.back()) cerr << " "; } cerr << endl; }
template <class Type> void Debug(vector<vector<Type>> &df) { for (auto& vec : df) { Debug(vec); } }

int score(int D, const vector<int>& c, const vector<vector<int>>& s, const vector<int>& t)
{
    int res = 0;
    vector<int> last(26);
    int value = 0;
    rep (d, D)
    {
        int i = t[d] - 1;
        value += s[d][i];
        last[i] = d+1;
        rep (k, 26)
        {
            value -= c[k] * (d+1 - last[k]);
        }
        res = (int)1e6 + value;
    }
    return res;
}

using P = pair<int, int>;
bool comp(const P& firstElof, const P& secondElof)
{
    return firstElof.second > secondElof.second;
}

vector<int> greedy(int D, const vector<int>& c, const vector<vector<int>>& s)
{
    static random_device rnd;
    static mt19937 mt(rnd());

    vector<P> c_pair(26);
    rep (i, 26) c_pair[i] = make_pair(i, c[i]);

    priority_queue<P, vector<P>, function<bool(const P&, const P&)>> c_rank{comp};
    rep (i, len(c))
    {
        c_rank.push(c_pair[i]);
    }

    vector<int> t(D);
    queue<P> que;
    rep (i, D)
    {
        P today = c_rank.top(); c_rank.pop();
        que.push(today);
        uniform_int_distribution<> rand_que(1, 10);
        rep (k, len(que))
        {
            if (rand_que(mt) >= 8 and !que.empty())
            {
                c_rank.push(que.front());
                que.pop();
            }
        }

        int m = INT_MIN;
        int index = 0;
        rep (type, 26)
        {
            if (chmax(m, s[i][type]))
            {
                index = type;
            }
        }

        vector<int> w(7);
        w[0] = today.first;
        w[1] = today.first;
        w[2] = index;
        w[3] = index;
        w[4] = index;
        w[5] = index;
        w[6] = index;
        shuffle(w.begin(), w.end(), mt);

        t[i] = w[0];
    }

    return t;
}

vector<int> calc_t(int D, const vector<int>& c, const vector<vector<int>>& s)
{
    static random_device rnd;
    static mt19937 mt(rnd());
    //uniform_int_distribution<> rand26(1, 26);
    vector<int> t = greedy(D, c, s);

    return t;
}

signed main()
{
    // in
    Cin(int, D);
    Cinv(int, c, 26);
    Cinvv(int, s, D, 26);
    vector<int> t = calc_t(D, c, s);

    rep (i, len(t)) Print(t[i] + 1);

    //Debug("=== score ===");
    //Debug(score(D, c, s, t));
    //Debug("=============");

    return 0;
}



Measured memory_bytes: 3708