#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
// vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

struct dice {
  mt19937 mt;
  dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
  // [0, x)の一様乱数
  ll operator()(ll x) { return this->operator()(0, x); }
  // [x, y)の一様乱数
  ll operator()(ll x, ll y) {
    uniform_int_distribution<ll> dist(x, y - 1);
    return dist(mt);
  }
  vl operator()(int n, ll x, ll y) {
    vl res(n);
    for (int i = 0; i < n; i++) res[i] = this->operator()(x, y);
    return res;
  }
} rnd;

int D = 365;
int M = 26;
vi c(M);
vii s(D, vi(M));
vi t(D);

vii last(D + 1, vi(M));


void input() {
    cin >> D;
    rep (i, M) cin >> c[i];
    rep (i, D) {
        rep (j, M) {
            cin >> s[i][j];
        }
    }

    rep (i, D) {
        t[i] = 0;
    }
}

vi next_day(D + 1), pre_day(D + 1);
vector<set<int>> days(M);

void init_t() {
    rep (i, D) {
        pii ma(-inf, -inf);
        rep (j, M) {
            chmax(ma, pii(s[i][j], j));
        }
        t[i] = ma.second;
        days[ma.second].insert(i + 1);
    }
    rep (j, M) {
        days[j].insert(0);
        days[j].insert(D + 1);
    }

    rep (j, M) {
        int pre = 0;
        rep (i, D) {
            if (t[i] == j) {
                pre_day[i + 1] = pre;
                pre = i + 1;
            }
        }
    }
    rep (j, M) {
        int nex = D + 1;
        rrep (i, D) {
            if (t[i] == j) {
                next_day[i + 1] = nex;
                nex = i + 1;
            }
        }
    }
}

int calc_score() {
    int score = 0;
    rep (i, D) {
        score += s[i][t[i]];
        rep (j, M) last[i + 1][j] = last[i][j];
        last[i + 1][t[i]] = i + 1;
        rep (j, M) {
            score -= c[j] * (i + 1 - last[i + 1][j]);
        }
    }
    return score;
}

int score_change(int d, int q, bool replace=false) {
    int ori = t[d - 1];
    int change = 0;
    auto itr = days[q].lower_bound(d);
    ll mul1 = (*itr - d);
    itr--;
    mul1 = mul1 * c[q] * (*itr - d);
    change -= mul1;
    if (replace) {
        days[q].insert(d);
    }

    // ll change2 = 0;
    // for (int i = d; i <= D; i++) {
    //     if (last[i][q] == i) break;
    //     // change2 -= c[q] * (last[i][q] - d);
    //     if (replace) last[i][q] = d;
    // }
    // DEBUG(pll(change, change2));

    itr = days[ori].lower_bound(d);
    assert(*itr == d);
    itr--;
    int nex_last = *itr;
    itr = days[ori].lower_bound(d + 1);
    mul1 = (*itr - d);
    change -= mul1 * c[ori] * (d - nex_last);

    if (replace) {
        days[ori].erase(d);
    }

    // int nex_last2 = last[d - 1][ori];
    // assert(nex_last == nex_last2);
    // for (int i = d; i <= D; i++) {
    //     if (last[i][ori] == i and i != d) break;
    //     // change -= c[ori] * (last[i][ori] - nex_last);
    //     if (replace) last[i][ori] = nex_last;
    // }
    change -= s[d - 1][ori];
    change += s[d - 1][q];
    if (replace) t[d - 1] = q;
    return change;
}

signed main() {
    clock_t start = clock();
    fio();

    input();
    init_t();

    ll score = calc_score();
    int cnt1 = 0, cnt2 = 0;
    while (static_cast<double>(clock() - start) / CLOCKS_PER_SEC * 1000.0 <= 1950) {
        double rate = static_cast<double>(clock() - start) / CLOCKS_PER_SEC / 2.;
        rate = (rate + 4) + 100;
        // DEBUG(rate);
        cnt1++;
        int d = rnd(1, D + 1), q = rnd(M);
        if (t[d - 1] == q) {
            continue;
        }
        int change = score_change(d, q, false);
        int temp = 1000000;
        if (change >= 0 or rnd(temp) >= temp * rate) {
        // if (change >= 0) {
            cnt2++;
            score += score_change(d, q, true);
        }
    }

    DEBUG(pii(cnt1, cnt2));
    DEBUG(score);

    rep (i, D) {
        cout << t[i] + 1 << endl;
    }
}

Measured memory_bytes: 3792