#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;

    //int score_down[26]; // 満足度の下がりやすさ
    //int score_up[365][26]; // 満足度の増加数
    //int contest[365]; // コンテストのタイプ
    //int last[26];

    int d = 365;

    class Contests {
    public:
        vector<int> body;
        vector<set<int>> pos;

        Contests() {
            body = vector<int>(d);
            pos = vector<set<int>>(26, set<int>());
            rep(i, 26) pos[i].emplace(-1), pos[i].emplace(d);
        }

        // d日目をtypeに変える
        void ChangeValue(int type, int d) {
            // その日は何か
            int delete_type = body[d];
            pos[delete_type].erase(d);
            body[d] = type;
            pos[type].emplace(d);
        }

        // d日目の前後の日付を取得する
        pair<int, int> GetNeighDate(int type, int d) {
            auto it = pos[type].find(d);
            return { *prev(it), *next(it) };
        }
    };

    // スコアを計算する
    int CalcScore(vector<int>& score_down, vector<vector<int>>& score_up, Contests& contest) {
        int score = 0;
        vector<int> last(26, -1);
        rep(i, d) {
            int type = contest.body[i];
            // 満足度の増加
            score += score_up[i][type];
            last[type] = i;
            // 時間による満足度の低下
            rep(j, 26) {
                score -= score_down[j] * (i - last[j]);
            }
        }
        return score;
    }

    // スコアの差を計算する
    int CalcScoreDiff(Contests& contest, vector<int>& score_down, vector<vector<int>>& score_up, int date, int new_type) {
        int delete_type = contest.body[date];
        auto neigh_prev = contest.GetNeighDate(delete_type, date);
        contest.ChangeValue(new_type, date);
        auto neigh_next = contest.GetNeighDate(new_type, date);

        int score_diff = 0;
        // 増加
        {
            int a = neigh_next.first;
            int b = neigh_next.second;
            int dif = b - a;
            int score = -score_down[new_type] * (dif * (dif + 1) / 2);
            int na = date - a;
            int nb = b - date;
            score += score_down[new_type] * (na * (na + 1) / 2 + nb * (nb + 1) / 2);
            score_diff += score;
        }

        // 減少
        {
            int a = neigh_prev.first;
            int b = neigh_prev.second;
            int dif = b - a;
            int score = -score_down[delete_type] * (dif * (dif + 1) / 2);
            int na = date - a;
            int nb = b - date;
            score += score_down[delete_type] * (na * (na + 1) / 2 + nb * (nb + 1) / 2);
            score_diff -= score;
        }
        // 戻す
        contest.ChangeValue(delete_type, date);
        return -score_diff;
    }

    // 山登り法じゃない
    int NotHillClimbing(Contests& contest, vector<int>& score_down, vector<vector<int>>& score_up) {
        // 初期スコアの計算
        int score = 0;
        score = CalcScore(score_down, score_up, contest);

        int cnt = 0;
        while (cnt++ < 15000) {
            for (int date = 0; date < d; ++date) {
                // 変更先をランダムに
                int type = rand() % 26;
                int score_diff = CalcScoreDiff(contest, score_down, score_up, date, type);

                // よくなった
                if (score_diff > 0) {
                    score += score_diff;
                    contest.ChangeValue(type, date);
                }
            }
        }

        return score;
    }

    // 初期のコンテストを設定
    void InitializeContests(Contests& contests, vector<int>& score_down) {
        //// コンテストを均等な数並べる
        //vector<pair<int, int>> s_down(26);
        //rep(i, 26) {
        //    s_down[i] = { score_down[i], i };
        //}
        //sort(allof(s_down), greater<pair<int, int>>());
        //// コストの減少が大きい奴ほど量を多くする

        // 今はランダムで...
        rep(i, d) {
            int type = rand() % 26;
            contests.body[i] = type;
            contests.pos[type].emplace(i);
        }
    }
}

int main() {
    srand((unsigned)time(NULL));

    cin >> d;
    vector<int> score_down = inp(26);
    vector<vector<int>> score_up = inp(d, 26);
    Contests contest;

    // とりあえず山登り法やってみる
    InitializeContests(contest, score_down);

    NotHillClimbing(contest, score_down, score_up);

    rep(i, d) ++contest.body[i];
    Cout(contest.body, "\n");

    return 0;
}


Measured memory_bytes: 3688