#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

#define TIME_LIMIT 2000

int d, c[26], s[365][26];
struct state {
    int v = 0, turn = 0, last[365][26] = {}, t[365] = {};
    state() {
        FOR(i, 0, 26)last[0][i] = -1;
    }
    void next_turn(int b) {
        t[turn] = b;
        if (0 < turn)FOR(j, 0, 26)last[turn][j] = last[turn - 1][j];
        v += s[turn][b];
        last[turn][b] = turn;
        FOR(j, 0, 26)v -= c[j] * (turn - last[turn][j]);
        ++turn;
    }
    int next_score(int b) {
        int res = v + s[turn][b];
        FOR(j, 0, 26)if (j != b)res -= c[j] * (turn - last[turn][j]);
        return res;
    }
};

bool operator<(state a, state b) { return a.v < b.v; }
bool operator>(state a, state b) { return a.v > b.v; }

int main() {
    init();


    cin >> d;
    FOR(j, 0, 26)cin >> c[j];
    FOR(i, 0, d)FOR(j, 0, 26)cin >> s[i][j];

    priority_queue<state> pq1;
    pq1.emplace(state());

    random_device hoge;
    mt19937 mt(hoge());
    uniform_int_distribution<> type(0, 25);//[]

    FOR(i, 0, d) {
        PQ<state> pq2;
        while (!pq1.empty()) {
            state cur = pq1.top();
            pq1.pop();

            FOR(j, 0, 5) {
                state ft = cur;
                ft.next_turn(type(mt));
                pq2.emplace(ft);
            }
        }
        while (13 < pq2.size())pq2.pop();
        while (!pq2.empty()) {
            pq1.emplace(pq2.top());
            pq2.pop();
        }
    }

    state ans = pq1.top();
    FOR(i, 0, d)print(ans.t[i] + 1);

    return 0;
}


Measured memory_bytes: 11364