#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
//#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {
    if (a > b) a = b;
}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {
    if (a < b) a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

constexpr int BEAM = 50;
constexpr int D = 365;
constexpr int N = 26;
int C[N + 1];
int S[D][N];
struct State {
    vector<int16_t> result;
    int score;
    int16_t days;
    State(int d = 0) : result(D, 26), days(d), score(0) {}
    bool operator<(const State& rhs) {
        if (score != rhs.score)
            return score < rhs.score;
        else
            return result < rhs.result;
    }
    bool operator>(const State& rhs) {
        if (score != rhs.score)
            return score > rhs.score;
        else
            return result > rhs.result;
    }
    bool operator==(const State& rhs) { return score == rhs.score && result == rhs.result; }
    inline void output() {
        REP(i, D) { cout << result[i] + 1 << '\n'; }
    }
};
int las[D][N];
int calc_score(const State& s) {
    int ret = 0;
    int d = min(D, s.days + 6);
    REP(j, N) las[0][j] = -1;
    REP(i, d) {
        las[i][s.result[i]] = i;
        ret += S[i][s.result[i]];
        REP(j, N) { ret -= C[j] * (i - las[i][j]); }
        REP(j, N) las[i + 1][j] = las[i][j];
    }
    return ret;
}

void solve() {
    int dummy;
    cin >> dummy;
    REP(i, N) cin >> C[i];
    REP(i, D) REP(j, N) cin >> S[i][j];
    vector<State> curr;
    curr.emplace_back(0);
    REP(i, D) {
        // cerr << "day:" << i + 1 << endl;
        vector<State> next;
        for (auto& s : curr) {
            State tmp = s;
            tmp.days++;
            REP(j, N) {
                tmp.result[i] = j;
                tmp.score = calc_score(tmp);
                next.push_back(tmp);
            }
        }
        sort(next.rbegin(), next.rend());
        if (next.size() > BEAM) next.resize(BEAM);
        curr = move(next);
    }
    cerr << "score:" << curr[0].score << endl;
    curr[0].output();
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}


Measured memory_bytes: 4896