#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) for(int i=0;i<int(r);i++)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) for(int i=int(r)-1;i>=0;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#define inf INT_MAX/2-100
#define infl LLONG_MAX/3
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<' '<<#x<<' '<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u>void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u>void chmin(t&a,u b){if(b<a)a=b;}

template<class t>using vc=vector<t>;
template<class t>using vvc=vector<vector<t>>;

using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vi=vc<int>;
using vl=vc<ll>;


ll readl(void){
	ll x;
	cin>>x;
	return x;
}
int readi(void){
	int x;
	cin>>x;
	return x;
}

string readstr(){
	string s;
	cin>>s;
	return s;
}
vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=readi(),v[i]+=off;
	return v;
}

vl readvl(int n,int off=0){
	vl v(n);
	rep(i,n)v[i]=readl(),v[i]+=off;
	return v;
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)cout<<"\n";
	if(suc==2)cout<<" ";
}

template<class t>
void print(const vc<t>&v,int suc=1){
	rep(i,si(v))print(v[i],i==int(si(v))-1?1:suc);
}

template<class t>
bool inc(t a,t b,t c){
	return !(c<b||b<a);
}

template<class t>
void compress(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

template<class t>
struct Compress{
	vc<t>v;
	Compress()=default;
	Compress(const vc<t>&x){
		add(x);
	}
	Compress(const initializer_list<vc<t> >&x){
		for(auto &p:x)add(p);
	}
	void add(const t&x){
		v.eb(x);
	}
	void add(const vc<t>&x){
		copy(all(x),back_inserter(v));
	}
	void build(){
		compress(v);
	}
	int get(const t&x)const{
		return lwb(v,x);
	}
	vc<t>get(const vc<t>&x)const{
		vc<t>res(x);
		for(auto &p:res)p=get(p);
		return res;
	}
	const t &operator[](int x)const{
		return v[x];
	}
};
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
}
void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
}
void orYes(bool x,bool ex=true){
	if(x)Yes(ex);
	else No(ex);
}
void orYES(bool x,bool ex=true){
	if(x)YES(ex);
	else NO(ex);
}
void Possible(bool ex=true){
	cout<<"Possible\n";
	if(ex)exit(0);
}
void POSSIBLE(bool ex=true){
	cout<<"POSSIBLE\n";
	if(ex)exit(0);
}
void Impossible(bool ex=true){
	cout<<"Impossible\n";
	if(ex)exit(0);
}
void IMPOSSIBLE(bool ex=true){
	cout<<"IMPOSSIBLE\n";
	if(ex)exit(0);
}
void orPossible(bool x,bool ex=true){
	if(x)Possible(ex);
	else Impossible(ex);
}
void orPOSSIBLE(bool x,bool ex=true){
	if(x)POSSIBLE(ex);
	else IMPOSSIBLE(ex);
}

#define timelim 1900
int n,c[30],s[400][30],sm[400],d[400],ss,pd[3000];
set<int>p[30];
int out(int x,bool ex=false){
	int res=0;
	auto it=p[d[x]].find(x);
	it--;
	int lx=*it;
	it++;
	it++;
	int rx=*it;
	res+=sm[x-lx-1];
	res+=sm[rx-x-1];
	res-=sm[rx-lx-1];
	if(ex)p[d[x]].erase(x);
	return res;
}
int in(int x,int y){
	d[x]=y;
	p[y].insert(x);
	return -out(x);
}
int change(int x,int y){
	int res=0;
	res-=s[x][d[x]];
	res-=s[y][d[y]];
	res+=s[y][d[x]];
	res+=s[x][d[y]];
	res+=out(x,true);
	res+=out(y,true);
	int tmp=d[x];
	res+=in(x,d[y]);
	res+=in(y,tmp);
	return res;
}
int main(void){
	cin.tie(0);
	ios::sync_with_stdio(0);
	chrono::system_clock::time_point start;
	start=chrono::system_clock::now();
	double start_tmp=50,end_tmp=10;
	srand(unsigned(time(NULL)));
	for(int i=1;i<400;i++)sm[i]=sm[i-1]+i;
	cin>>n;
	rep(i,26){
		cin>>c[i];
		for(int j=ss;j<ss+c[i];j++)pd[j]=i;
		ss+=c[i];
		p[i].insert(-1);
		p[i].insert(365);
	}
	rep(i,n)rep(j,26)cin>>s[i][j];
	for(int i=0;i<n;i++){
		d[i]=pd[rand()%ss];
		p[d[i]].insert(i);
	}
	while(1){
		double dur=static_cast<double>(chrono::duration_cast<chrono::microseconds>(chrono::system_clock::now()-start).count())/1000.0;
		if(dur>timelim){
			//cout<<dur<<endl;
			break;
		}
		int x=rand()%n,y=rand()%n;
		if(x==y){
			y=(y+1)%n;
		}
		double temp = start_tmp + (end_tmp - start_tmp) * dur /timelim;
		double prob = exp((double)change(x,y)/temp);
		if(prob>(rand()%inf)/(double)inf){
			p[d[x]].erase(x);
			p[d[y]].erase(y);
			p[d[x]].insert(y);
			p[d[y]].insert(x);
			swap(d[x],d[y]);
		}
	}
	rep(i,n)print(d[i]+1);
}


Measured memory_bytes: 4368