#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/

bool multicase = false;

ll n, k, num, a, b, c, d, e, h, q, ans, sum;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

vec permutation;

ll cost[505];
ll table[400][30];
ll last[50];
ll decision[500];
ll last_tmp[50];

ll final_decision[500];
ll score_sub_tmp[500];

ll score_sum;

string s, t;
set<ll> contest[30];

const ll m = 26;

struct Timer {
    int64_t start;
    const int64_t CYCLES_PER_SEC = 2800000000;
    Timer() { reset(); }
    void reset() { start = getCycle(); }
    inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
    inline int64_t getCycle() {
        uint32_t low, high;
        __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high));
        return ((int64_t)low) | ((int64_t)high << 32);
    }
};

Timer timer;

ll range(ll a, ll b) {
    //generate random number [a, b]
    ll num = rand() % (1 + b - a) + a;
    return num;
}

ll calc_score_sub(ll choice){
    // choiceは1-idxで与えること
    ll last = 0;
    ll res = 0;
    for(auto day: contest[choice]){
        ll length = day - last;
        ll square = length * (length - 1) / 2;
        ll weight = cost[choice] * square;
        res -= weight;
        res += table[day - 1][choice - 1];
        assert(day >= last);
        last = day;
    }
    ll length = d + 1 - last;
    ll square = length * (length - 1) / 2;
    ll weight = cost[choice] * square;
    res -= weight;
    score_sub_tmp[choice] = res;
    return res;
}

ll calc_score() {
    // 全ての種類についてスコアを計算する
    ll res = 0;
    for(ll i=1;i<=m;i++){
        res += calc_score_sub(i);
    }
    return res;
}

void initialize() {
    for (ll i = 0; i < m; i++) {
        last[i] = 0;
        contest[i+1].clear();
    }
    for (ll i = 0; i < d; i++) {
        // この日、何を選ぶか？
        
        ll index = -1, maxi = -INF;
        for (ll j = 0; j < m; j++) {
            ll score = table[i][j] + ((i + 1) - last[j]) * cost[j + 1] * 3 + range(0, 1000);
            if (score > maxi) {
                maxi = score;
                index = j;
            }
        }
        // score_sum += maxi;
        last[index] = i + 1;
        decision[i] = index + 1;
        contest[decision[i]].insert(i + 1);
    }
    return;
}

void solve() {
    timer.reset();
    cin >> d;
    for (ll i = 1; i <= m; i++) {
        cin >> cost[i];
    }
    for (ll i = 0; i < d; i++) {
        for (ll j = 0; j < m; j++) {
            cin >> table[i][j];
        }
    }
    
    initialize();
    
    ll last_score = calc_score();
    ll final_score = -INF;

    ll count = 0;
    while (timer.get() <= 1.97) {
        count ++;

        for (ll i = 0; i < 300; i++) {

            ll dif = range(1, 3);

            ll a = range(0, d-dif), b = a + dif;

            if (decision[a] == decision[b]) continue;

            contest[decision[a]].erase(a+1);
            contest[decision[b]].erase(b+1);

            contest[decision[b]].insert(a+1);
            contest[decision[a]].insert(b+1);

            swap(decision[a], decision[b]);

            ll tmp1 = score_sub_tmp[decision[a]] + score_sub_tmp[decision[b]];

            ll now_score = last_score - score_sub_tmp[decision[a]] - score_sub_tmp[decision[b]];
            now_score += calc_score_sub(decision[a]) + calc_score_sub(decision[b]);

            // pe(now_score);p(last_score);
            
            if (now_score > last_score) {
                last_score = now_score;
            } else {


                swap(decision[a], decision[b]);

                contest[decision[b]].erase(a+1);
                contest[decision[a]].erase(b+1);

                contest[decision[a]].insert(a+1);
                contest[decision[b]].insert(b+1);

                calc_score_sub(decision[a]);
                calc_score_sub(decision[b]);
            }
        }

        // line();
        if (last_score > final_score) {
            final_score = last_score;
            for (ll i = 0; i < d; i++) {
                final_decision[i] = decision[i];
            }
        }
        initialize();
        last_score = calc_score();
    }

    // debug
    // pe("final_score is "); p(final_score);
    // pe("iteration is "); p(count);
    for (ll i = 0; i < d; i++) {
        p(final_decision[i]);
    }
    

    /*
    for(ll i=0;i<q;i++){
        cin >> a >> b;
        ll before = decision[a-1], after = b;
        contest[before].erase(a);
        contest[after].insert(a);
        decision[a-1] = b;
        ll new_score = score - score_sub_tmp[before] - score_sub_tmp[after];
        new_score = new_score + calc_score_sub(before) + calc_score_sub(after);
        score = new_score;
        p(new_score);
    }
    */
    return;
}

int main() {
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}



Measured memory_bytes: 3768