#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define Yes "Yes"
#define No "No"
#define DEFAULT LL ans=solve();\
 	if(ans==NONE){\
 	}else{\
 		cout << ans << endl;\
 	}
#define YESNO three(solve(),(OUT(YES),1),(OUT(NO),0))
#define YesNo three(solve(),OUT(Yes),OUT(No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(b-1);i>=(LL)(a);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,zero,b)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template<typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template<typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<pr, Vpr > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
const int SIZE1 = 5e5 + 1000;
const int SIZE2 = 5010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p998 = 998244353;
const LL p107 = 1000000007;
const LL p = p107;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
const LL NONE=-2;
#define endl "\n"
ut N, M,K,  Q, D, H, W;
VI edges[SIZE];
const LL CON=26;
const int TIME=1500;
LL vals[SIZE], answer = zero;
//LL A[SIZE],B[SIZE],C[SIZE];
LL s[400][30];
LL c[SIZE];
Vpr dayrank[400];
mt19937 rn;
std::chrono::system_clock::time_point starttime,endtime;
double st(){
 starttime = std::chrono::system_clock::now(); // 計測開始時間
 return 0;
}
double ed(){
 
 endtime = std::chrono::system_clock::now();  // 計測終了時間d
 double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(endtime-starttime).count(); //処理に要した時間をミリ秒に変換
 return elapsed;
}
inline LL f(LL x,LL r){
	return x*r*(r+1)/2;
}
LL score_fast(const VI& v,LL k=-1,bool isS=true){
	if(k==-1) k=v.size();
	assert(v.size()==D);
	VI last(CON);
	LL ans=0;
	REP(i,k){
		LL tcon=v[i];
//		if(isS)
			ans+=s[i][tcon];
		ans-=f(c[tcon],i+1-last[tcon]-1);		
		last[tcon]=i+1;
	}
	REP(i,CON){
		ans-=f(c[i],k+1-last[i]-1);
	}
	return ans;	
}
LL loops=0;
LL score(const VI& v,LL k=-1,bool isS=true){
	loops++;
	return score_fast(v,k,isS);
	if(k==-1) k=v.size();
	assert(v.size()==D);
	VI last(CON);
	LL ans=0;
	REP(i,k){
		LL tcon=v[i];
		if(isS)
			ans+=s[i][tcon];
		last[tcon]=i+1;
		REP(j,CON) ans-=c[j]*(i+1-last[j]);
	}
	assert(ans==score_fast(v,k,isS));
	return ans;
}
void DEBUGscore(const VI& v){
	cerr << score(v) << endl;
}
void output(const VI& x){
	REP(i,x.size()){
		cout << x[i]+1 <<endl;
	}
}

void make_init(VI& v){
	DEBUGscore(v);
	REP(i,v.size()){
		LL mx=score(v);
		int next=0;
		REP(j,CON){
			v[i]=j;
			if(MX(mx,score(v,i+1,true))){
				next=j;
			}
		}
		v[i]=next;
	//	cerr << next << endl;
	}
	DEBUGscore(v);
	return;
}
uniform_real_distribution<> rand1(0,1); 
LL solve(){
	cin >> D;
	REP(i,CON){
		cin >> c[i];
	}
	REP(i,D){
		REP(j,CON){
			cin >> s[i][j];
			dayrank[i].pb(s[i][j],j);
		}
		sort(ALL(dayrank[i]));
	}
	VI ans(D);
	make_init(ans);
	LL ansscore=score(ans);
	bool reached=false;
	LL time=0;
	while((time=ed())<=TIME){
		if(time>TIME/2 and !reached){
			DEBUGscore(ans);
			reached=true;
		}
		REP(i,1000){
			VI newans=ans;
			if(0){
				newans[rn()%D]=rn()%CON;	
			}else if(i%3==0){
				LL d=rn()%D;
				newans[d]=dayrank[d][(int)sqrt(rn()%(CON*CON))].second;
			}else if(i%3==1){
				LL k=rn()%(D);
				LL k2=rn()%(D);
				LL k3=(k+k2)/2;
				swap(newans[k],newans[k2]);
				swap(newans[k2],newans[k3]);
			}
			else{
				LL k=rn()%(D);
				LL k2=rn()%(D);
				swap(newans[k],newans[k2]);
			}
			LL newscore=score(newans);
			//if(time<100) cerr << newscore-ansscore << " "<< exp(newscore-ansscore) << " " << rand1(rn) << endl;
			if(ansscore<newscore){
				ans=newans;
				ansscore=newscore;
			}			
		}
	}
	DEBUGscore(ans);
	output(ans);
	cerr <<"LOOP"<< loops << endl;
	return NONE;
}
 signed main() {
 
	st();
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	LL T=1;
	REP(i,T){
		DEFAULT;

	}
//	YesNo;
//	YESNO;
//	three(solve(),OUT("First"),OUT("Second"));
	//cin >> N;
	return 0;
 
}


Measured memory_bytes: 15732