#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}

int main(){
    clock_t start = clock();
    lint n,m=26;
    cin>>n;
    vec c(m);
    mat s(n,vec(m,0));
    rep(i,m)cin>>c[i];
    rep(i,n)rep(j,m)cin>>s[i][j];
    vector<set<lint>> l(m);
    vec t(n);
    auto f=[&](){
        vec last(m,-1);
        rep(i,n){
            lint mx=-INF,idx=0;
            rep(j,m){
                if(chmax(mx,s[i][j]+c[j]*(i-last[j])))idx=j;
            }
            t[i]=idx;
            last[idx]=i;
            l[idx].insert(i);
        }
    };
    auto get=[&](vec t){
        vec last(m,-1);
        lint res=0;
        rep(i,n){
            res+=s[i][t[i]];
            last[t[i]]=i;
            rep(j,m){
                res-=c[j]*(i-last[j]);
            }
        }
        return res;
    };
    auto diff=[&](lint d,lint k)->lint{
        lint res=0;
        res-=s[d][t[d]];
        res+=s[d][k];
        {
            auto itr=l[t[d]].upper_bound(d);
            lint p=(prev(itr,1)==l[t[d]].begin()?-1:*prev(itr,2));
            lint q=(itr==l[t[d]].end()?n:*itr);
            res-=(q-d)*(d-p)*c[t[d]];
        }
        {
            auto itr=l[k].upper_bound(d);
            lint p=(itr==l[k].begin()?-1:*prev(itr,1));
            lint q=(itr==l[k].end()?n:*itr);
            res+=(q-d)*(d-p)*c[k];
        }
        return res;
    };
    f();
    double time=0;
    lint tmp=0;
    srand(clock());
    while((time=static_cast<double>(clock()-start)/CLOCKS_PER_SEC*1000.0)<=1900){
        // if(time>tmp){
        //     tmp+=100;
        //     cout<<get(t)<<endl;
        // }
        lint dif=0;
        vector<tuple<lint,lint,lint>>change;
        rep(i,(2000-time)/200){
            lint d=rand()%n,k=rand()%m;
            dif+=diff(d,k);
            if(dif>=0){
                t[d]=k;
                l[t[d]].erase(d);
                l[k].insert(d);
                if(rand()%3==0)break;
            }else{
                change.emplace_back(d,k,t[d]);
                t[d]=k;
                l[t[d]].erase(d);
                l[k].insert(d);
            }
        }
        if(dif>0)continue;
        reverse(all(change));
        for(auto [d,k,td]:change){
            l[k].erase(d);
            l[td].insert(d);
            t[d]=td;
        }
    }
    //cout<<get(t)<<endl;
    rep(i,n){
        cout<<t[i]+1<<endl;
    }
}

// int main(){
//     lint n=365;
//     lint m=26;
//     cout<<n<<endl;
//     random_device rnd;
//     vec c(m);
//     mat s(n,vec(m,0));
//     rep(i,m)c[i]=rnd()%101;
//     rep(i,n)rep(j,m)s[i][j]=rnd()%20001;
//     output(c);
//     output2(s);
// }

Measured memory_bytes: 3788