//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}

vector<vector<ll>>s;
vector<ll>c;
ll d;
struct Score{
  ll now;
  vector<set<ll>>st;
  vector<ll>t;
  Score(){
    now=0;
    st.resize(26);
    rep(i,0,26){
      st[i].insert(-1);
      st[i].insert(d);
    }
    t.assign(d,-1);
    build_init();
  }
  void build_init(){
    ll ret=0;
    rep(i,0,d){
      P mx(-INF,-INF);
      rep(j,0,26)chmax(mx,MP(calc(i,j),j));
      insert(i,mx.se);
    }
  }
  ll calc(ll idx,ll x){
    ll ret=0;
    auto pre=*st[x].upper_bound(idx);
    ret-=f(idx-pre)*c[x];
    auto nxt=*(--st[x].lower_bound(idx));
    ret-=f(nxt-idx)*c[x];
    ret+=f(nxt-pre)*c[x];
    ret+=s[idx][x];
    return ret;
  }
  ll update_calc(ll idx,ll x){
    //cout<<"calc" spa idx spa x spa calc(idx,x) spa calc(idx,t[idx])<<endl;
    return calc(idx,x)-calc(idx,t[idx]);
  }
  void insert(ll idx,ll x){
    now+=calc(idx,x);
    t[idx]=x;
    st[x].insert(idx);
  }
  void update(ll idx,ll x){
    now+=update_calc(idx,x);
    st[t[idx]].erase(idx);
    st[x].insert(idx);
    t[idx]=x;
  }
  ll swap_calc(ll idx1,ll idx2){
    return update_calc(idx1,t[idx2])+update_calc(idx2,t[idx1]);
  }
  void swap(ll idx1,ll idx2){
    now+=swap_calc(idx1,idx2);
    ll tmp=t[idx1];
    update(idx1,t[idx2]);
    update(idx2,tmp);
  }
  ll f(ll x){
    return x*(x-1)/2;
  }
  ll scoring(){
    ll ret=0;
    vector<ll>last(26,-1);
    rep(i,0,d){
      ret+=s[i][t[i]];
      last[t[i]]=i;
      rep(j,0,26)ret-=c[j]*(i-last[j]);
      //cout<<ret<<endl;
    }
    return ret;
  }
};
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
struct RandomNumberGenerator {
  mt19937_64 mt;

  RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

  ll operator()(ll a, ll b) { // [a, b)
    uniform_int_distribution< ll > dist(a, b - 1);
    return dist(mt);
  }

  ll operator()(ll b) { // [0, b)
    return (*this)(0, b);
  }
};
RandomNumberGenerator rng;
const ll Divisor=1e9;
void anneal(){
  double start=clock();
  double end=start+1.9*CLOCKS_PER_SEC;
  const double start_tmp=10000;//スコアの最大値-最小値が目安?
  const double end_tmp=1;//小さい値
  auto judge=[&](double dif){
    double now=clock();
    if(now>=end)return false;
    double temp=start_tmp+(end_tmp-start_tmp)*(now-start)/(end-start);
    double prob=exp(dif/temp);
    return prob > double(rng(0,Divisor))/Divisor;
  };
  Score sc;
  //cout<<sc.now spa sc.scoring()<<endl;
  double num=0;
  while(clock()<end){
    if(rng(0,5)){
      ll nxt=rng(0,26);
      ll idx=rng(0,d);
      if(judge(sc.update_calc(idx,nxt))){
        sc.update(idx,nxt);
      }
    }
    else{
      ll idx1=rng(0,d-1);
      ll idx2=idx1+1;//rng(0,d);
      //ll idx2=rng(0,d);
      if(judge(sc.swap_calc(idx1,idx2))){
        sc.swap(idx1,idx2);
      }
    }
    if((clock()-start)>(end-start)*num){
      //cout<<endl;
      num+=0.01;
    }
  }
  //cout<<sc.now spa sc.scoring()<<endl;
  rep(i,0,d)cout<<sc.t[i]+1<<endl;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  ll start=clock();
  bool judge = true;
  cin>>d;
  ll num=26;
  c.resize(num);
  rep(i,0,num)cin>>c[i];
  s=vec(d,num,0LL);
  rep(i,0,d)rep(j,0,num)cin>>s[i][j];
  anneal();
  return 0;
}

Measured memory_bytes: 4348