#define EVAL 1
/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = true; // debug
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

using Query = ll;

/* #region rand */

class Rand {
    std::random_device rd; // Will be used to obtain a seed for the random number engine
    std::mt19937 gen;      // Standard mersenne_twister_engine seeded with rd()
    std::uniform_int_distribution<> dis;

  public:
    Rand(ll lb, ll ub) : rd(), gen(rd()), dis(lb, ub) {}
    int operator()() { return dis(gen); }
};

class RandDouble {
    std::random_device seed_gen;
    std::default_random_engine engine;
    std::uniform_real_distribution<> dist;

  public:
    RandDouble(double lb, double ub) : seed_gen(), engine(seed_gen()), dist(lb, ub) {}
    double operator()() { return dist(engine); }
};

/* #endregion */

ll update(ll D, vll &c, vvll &s, ll targetDay, Query fromContestType, Query toContestType, vc<set<ll>> &days) {
    ll sat = 0;
    auto it = days[fromContestType].find(targetDay);
    ll delta_d1;
    if (it == days[fromContestType].begin()) {
        // 最初の開催
        delta_d1 = targetDay + 1;
    } else {
        auto itcp = it;
        itcp--;
        delta_d1 = targetDay - *itcp;
    }
    it++;
    ll delta_d2;
    if (it == days[fromContestType].end()) {
        // 最後の開催
        delta_d2 = D - targetDay;
    } else {
        delta_d2 = *it - targetDay;
    }
    sat -= (delta_d1 * c[fromContestType]) * delta_d2;
    sat -= s[targetDay][fromContestType];
    days[fromContestType].erase(targetDay);

    // toContestType にして得する分の満足度を足す
    auto it2 = days[toContestType].lower_bound(targetDay); // 次の開催
    ll delta_d2_2;
    if (it2 == days[toContestType].end()) {
        // 次の開催がなかった
        delta_d2_2 = D - targetDay;
    } else {
        delta_d2_2 = *it2 - targetDay;
    }
    ll delta_d1_2;
    if (it2 == days[toContestType].begin()) {
        // 前の開催がなかった
        delta_d1_2 = targetDay + 1;
    } else {
        it2--;
        delta_d1_2 = targetDay - *it2;
    }
    sat += (delta_d1_2 * c[toContestType]) * delta_d2_2;
    sat += s[targetDay][toContestType];
    days[toContestType].insert(targetDay);

    return sat;
}

// Problem
void solve() {
    ll timespan_ms = 1950;
    ll timespan_clocks = (ll)(CLOCKS_PER_SEC * timespan_ms / 1000);
    clock_t start_time = clock();
    // clock_t end_time = start_time + timespan_clocks;

#ifndef EVAL
    ifstream ifs("./tester/example/sample1.in");
    // ifstream ifs("./tester/example/sample2.in");
    ll d;
    ifs >> d;
    vll c(26);
    ifs >> c;
    vvll s(d, vll(26));
    ifs >> s;
#else
    ll d;
    cin >> d;
    vll c(26);
    cin >> c;
    vvll s(d, vll(26));
    cin >> s;
#endif

    vc<Query> contests(d); // 各日のコンテスト種別

    // まずは適当な貪欲で試す
    ll sat = 0;
    vll last(26, 0);      // key: contetType
    vc<set<ll>> days(26); // 各コンテストが開催される日をセットで保持する
    ll DEPTH = 3;
    REP(curDay, 0, d) {
        // day 日目 (0-indexed)
        ll bestSat = -INF;
        vll bestContestTypes;
        auto dfs = [&](auto &&dfs, vll &contestTypes, ll cnt) -> void {
            if (cnt == DEPTH) {
                // calc score
                vll cpLast = last;
                ll cpSat = sat;
                REP(offset, 0, DEPTH) {
                    cpLast[contestTypes[offset]] = curDay + offset + 1;
                    REP(curContestType, 0, 26) {
                        cpSat -= ((curDay + 1 + offset) - cpLast[curContestType]) * c[curContestType];
                    }
                    cpSat += s[curDay + offset][contestTypes[offset]];
                }
                if (chmax(bestSat, cpSat)) {
                    bestContestTypes = contestTypes;
                }
                return;
            }
            REP(nextContestType, 0, 26) {
                contestTypes.push_back(nextContestType);
                dfs(dfs, contestTypes, cnt + 1);
                contestTypes.pop_back();
            }
        };
        {
            vll ct;
            dfs(dfs, ct, 0);
        }
        if (curDay == d - DEPTH) {
            REP(offset, 0, DEPTH) {
                ll bestContestType = bestContestTypes[offset];
                contests[curDay + offset] = bestContestType;
                last[bestContestType] = curDay + offset + 1;
                days[bestContestType].insert(curDay + offset);
                // calc sat
                REP(contetType, 0, 26) sat -= (curDay + offset + 1 - last[contetType]) * c[contetType];
                sat += s[curDay + offset][bestContestType];
            }
            break;
        } else {
            ll bestContestType = bestContestTypes[0];
            contests[curDay] = bestContestType;
            last[bestContestType] = curDay + 1;
            days[bestContestType].insert(curDay);
            // calc sat
            REP(contetType, 0, 26) sat -= (curDay + 1 - last[contetType]) * c[contetType];
            sat += s[curDay][bestContestType];
        }
    }
    // dump(contests, sat);
    // exit(0);

    double start_temp = 2000; // (一回の遷移で動きうるスコア幅の最大値程度);
    double end_temp = 30;     // (一回の遷移で動きうるスコア幅の最小値程度);
                              // ll temp = (線形でstart_tempからend_tempに減少する);

    Rand r_day(0, d - 1);
    Rand r_contest(0, 25);
    RandDouble rd(0, 1);
    while (true) {
        int targetDay = r_day();
        Query fromContest = contests[targetDay];
        Query toContest = r_contest();
        while (toContest == fromContest) toContest = r_contest();
        // assert toContest != fromContest

        // dump(targetDay, fromContest, toContest, days);
        ll dif = update(d, c, s, targetDay, fromContest, toContest, days);

        clock_t cur_time = clock();
        double ms = (double)(cur_time - start_time) * 1000.0 / CLOCKS_PER_SEC;
        // double force_line = (double)(end_time - cur_time) / timespan_clocks / 100; // 100 は要調整

        // 温度関数
        double temperature = start_temp + (end_temp - start_temp) * (double)(cur_time - start_time) / timespan_clocks;
        // 遷移確率関数(最大化の場合)
        double prob = exp((double)dif / temperature);

        if (prob > rd()) {
            sat += dif;
#ifndef EVAL
            cerr << sat << " (" << (dif >= 0 ? "+" : "") << dif << ") " << temperature << " " << prob << endl;
#endif
            contests[targetDay] = toContest;
            // diffs = diffs_new;
        } else {
            update(d, c, s, targetDay, toContest, fromContest, days);
        }

        if (ms > timespan_ms) break; //
    }

#ifdef EVAL
    REP(curDay, 0, d) cout << (contests[curDay] + 1) << endl;
#endif
}

// entry point
int main() {
    solve();
    return 0;
}


Measured memory_bytes: 4332