//#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;
}
//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;
vector<vector<ll>>s;
vector<ll>c;
ll d;
using TT=tuple<ll,ll,ll>;
struct Score{
  ll now;
  vector<set<ll>>st;
  Score(){
    now=0;
    st.resize(26);
    rep(i,0,26){
      st[i].insert(-1);
      st[i].insert(d);
    }
  }
  ll calc(ll idx,ll x){
    ll ret=0;
    auto pre=*st[x].lower_bound(idx);
    ret-=f(idx-pre)*c[x];
    auto nxt=*(--st[x].upper_bound(idx));
    ret-=f(nxt-idx)*c[x];
    ret+=f(nxt-pre)*c[x];
    ret+=s[idx][x];
    return ret;
  }
  void insert(ll idx,ll x){
    now+=calc(idx,x);
    st[x].insert(idx);
  }
  ll f(ll x){
    //cout<<x spa x*(x-1)/2 spa x*(x+1)/2<<endl;
    return x*(x-1)/2;
  }
};
vector<ll>t;
ll solve1(){
  t.clear();
  t.assign(d,-1LL);
  Score sc;
  priority_queue<TT>que;
  rep(i,0,26){
    ll cnt=0;
    while(1){
      ll idx=rng(0,d);
      if(t[idx]!=-1)continue;
      if(s[idx][i]>=17500){
        t[idx]=i;
        sc.insert(idx,i);
        break;
      }
      cnt++;
      if(cnt>=100)break;
    }
  }
  rep(i,0,d)rep(j,0,26){
    //cout<<i spa j spa sc.calc(i,j)<<endl;
    que.emplace(sc.calc(i,j),i,j);
  }
  while(!que.empty()){
    auto [val,idx,k]=que.top();
    que.pop();
    if(t[idx]!=-1)continue;
    if(val!=sc.calc(idx,k)){
      que.emplace(sc.calc(idx,k),idx,k);
      continue;
    }
    t[idx]=k;
    sc.insert(idx,k);
  }
  //rep(i,0,d)cout<<t[i]+1<<endl;
  //cout<<sc.now<<endl;
  return sc.now;
}
ll solve2(){
  t.clear();
  t.assign(d,-1LL);
  Score sc;
  priority_queue<TT>que;
  rep(i,0,d)rep(j,0,26){
    //cout<<i spa j spa sc.calc(i,j)<<endl;
    que.emplace(sc.calc(i,j),i,j);
  }
  while(!que.empty()){
    auto [val,idx,k]=que.top();
    que.pop();
    if(t[idx]!=-1)continue;
    t[idx]=k;
    sc.insert(idx,k);
  }
  rep(i,0,d)cout<<t[i]+1<<endl;
  //cout<<sc.now<<endl;
  return sc.now;
}
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];
  vector<ll>ret;
  ll mx=-INF;
  while(1){
    ll now=clock();
    if(now-start>=CLOCKS_PER_SEC*1.9)break;
    if(chmax(mx,solve1()))ret=t;
  }
  rep(i,0,d)cout<<ret[i]+1<<endl;
  solve1();
  return 0;
}

Measured memory_bytes: 4008