#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, v = 0, c[26], s[365][26], last[365][26], t[365];
void calc_score() {
    FOR(i, 0, d) {
        if (0 < i)FOR(j, 0, 26)last[i][j] = last[i - 1][j];
        v += s[i][t[i]];
        last[i][t[i]] = i;
        FOR(j, 0, 26)v -= c[j] * (i - last[i][j]);
    }
}
int changed_score(int a, int to) {
    int from = t[a], res = v + s[a][to] - s[a][from];
    {
        int pre_last = (a == 0 ? -1 : last[a - 1][from]);
        res -= c[from] * (a - pre_last);
        for (int i = a + 1; i < d && t[i] != from; ++i) {
            res += c[from] * (i - last[i][from]);
            res -= c[from] * (i - pre_last);
        }
    }
    {
        res += c[to] * (a - last[a][to]);
        for (int i = a + 1; i < d && t[i] != to; ++i) {
            res += c[to] * (i - last[i][to]);
            res -= c[to] * (i - a);
        }
    }
    return res;
}
void change(int a, int to) {
    int from = t[a];
    {
        last[a][from] = (a == 0 ? -1 : last[a - 1][from]);
        v -= c[from] * (a - last[a][from]);
        for (int i = a + 1; i < d && t[i] != from; ++i) {
            v += c[from] * (i - last[i][from]);
            last[i][from] = last[i - 1][from];
            v -= c[from] * (i - last[i][from]);
        }
    }
    {
        v += c[to] * (a - last[a][to]);
        last[a][to] = a;
        for (int i = a + 1; i < d && t[i] != to; ++i) {
            v += c[to] * (i - last[i][to]);
            last[i][to] = a;
            v -= c[to] * (i - a);
        }
    }
    t[a] = to;
    v += s[a][to] - s[a][from];
}

int main() {
    init();

    cin >> d;
    FOR(j, 0, 26)cin >> c[j];
    FOR(i, 0, d)FOR(j, 0, 26)cin >> s[i][j];
    //FOR(i, 0, d)cin >> t[i], --t[i];
    FOR(j, 0, 26)last[0][j] = -1;

    calc_score();

    random_device hoge; 
    mt19937 mt(hoge());   
    uniform_int_distribution<> day(0, 364), type(0, 25);//[]
    FOR(i, 0, d)t[i] = type(mt);

    clock_t start = clock();
    while (static_cast<double>(clock() - start) / CLOCKS_PER_SEC * 1000.0 < TIME_LIMIT - 30) {
        int a = day(mt), to = type(mt);
        if (v < changed_score(a, to) || day(mt) < 2)change(a, to);
    }
    FOR(i, 0, d)print(t[i] + 1);

    return 0;
}

Measured memory_bytes: 3768