#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define dbgmint(n,arr) rep(i,n){cerr<<arr[i].x<<" ";}cerr<<endl;
#define dbgarrmint(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j].x<<" ";}cerr<<endl;}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

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

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

int solve(){
    ll n;
    cin>>n;
    Vec c(26);
    cin>>c;
    clock_t start = clock();

    VV g(n, Vec(26));
    rep(i,n)rep(j,26) cin>>g[i][j];

    auto f = [](ll n){
        return n*(n+1)/2;
    };

    ll score = 0;
    ll minus = 0;
    rep(i,26) minus += c[i];
    score -= minus * f(n);

    Vec t(n);
//    cin>>t;
//    rep(i,n)t[i]--;

    vector<set<ll>> vst(26);
    rep(i,26)vst[i].insert(-1);
    rep(i,n){
        ll max = -1;

        ll selected = 0;
        rep(j,26){
            ll tmp = 0;
            tmp += g[i][j];
            auto itr = vst[j].lower_bound(i);
            itr--;
            ll last = *itr;
            tmp += (n-i) * (i - last) * c[j];

            if(chmax(max,tmp)){
                selected = j;
            }
        }
        score += g[i][selected];
        auto itr = vst[selected].lower_bound(i);
        itr--;
        ll last = *itr;
        score += (n-i) * (i - last) * c[selected];
        vst[selected].insert(i);

        t[i] = selected;
    }
    //out(score);
    while(clock()-start < 1900000){
        ll d,q;
//        cin>>d>>q;
////        d--;
////        q--;
        random_device rd;
        mt19937 mt1(rd());
        mt19937 mt2(rd());
        d = mt1()%n;
        q = mt2()%26;
        ll old = t[d];
        t[d] = q;
        auto itr = vst[old].lower_bound(d);
        itr--;
        ll befored = *itr;
        itr = vst[q].lower_bound(d);
        itr--;
        ll afterd = *itr;

        ll tmp = 0;
        tmp -= g[d][old];
        tmp -= (n-d) * (d-befored) * c[old];
        tmp += g[d][q];
        tmp += (n-d) * (d-afterd) * c[q];

        if(tmp>0){
            t[d] = q;
            vst[old].erase(d);
            vst[q].insert(d);
        }
    }
    rep(i,n){
        out(t[i]+1);
    }

    return  0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
    solve();
}


Measured memory_bytes: 4000