#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <limits.h>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

int D,C[30],S[400][30],ANS[400],PS[30];
vector<set<ll>> VANS(30);
ll PreP;
bool K[370];int LK[30],U=0;

unsigned long xor128(void) {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t;
    t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

ll Put_Score(){
  ll SUM=0;
  rep(i,D){
    ll ma=-LINF,key=-1;
    rep(k,26){
      ll SUM1=0;
      ll SUM2=0;
      SUM1+=S[i][k];
      SUM2+=S[i][k]+5.5*C[k];
      rep(j,26){
        if(k!=j){
          SUM1-=C[j]*(PS[j]+1);
          SUM2-=C[j]*(PS[j]+1);
        }
      }
      if(ma<SUM2){
        ma=SUM2;
        key=k;
      }
    } 
    ANS[i]=key;
    SUM+=S[i][ANS[i]];
    rep(j,26){
      if(ANS[i]!=j){
        PS[j]++;
        SUM-=C[j]*PS[j];
      }
      else{
        PS[j]=0;
      }
    }
  }

  rep(i,D){
    SUM+=S[i][ANS[i]];
    rep(j,26){
      if(ANS[i]!=j){
        PS[j]++;
        SUM-=C[j]*PS[j];
      }
      else{
        PS[j]=0;
      }
    }
    //cout << SUM << endl;
  }
  return SUM;
}

ll Che_Score(int a,int b,int p,int q){
  ll SUM=0,SUM1=0,k=0,k1=0;
  //cout << key << " " << q << endl;
  rep(i,D){
    if(ANS[i]==p){
      k=0;
      SUM+=S[i][p];
    }
    else{
      k++;
      SUM-=C[p]*k;
    }
    if(ANS[i]==q){
      k1=0;
      SUM+=S[i][q];
    }
    else{
      k1++;
      SUM-=C[q]*k1;
    }
  }
  k=0,k1=0;
  ANS[a]=q;ANS[b]=p;
  rep(i,D){
    if(ANS[i]==p){
      k=0;
      SUM1+=S[i][p];
    }
    else{
      k++;
      SUM1-=C[p]*k;
    }
    if(ANS[i]==q){
      k1=0;
      SUM1+=S[i][q];
    }
    else{
      k1++;
      SUM1-=C[q]*k1;
    }
  }
  return SUM1-SUM;
}

void input(){
  cin>>D;
  rep(i,26){
    cin >> C[i];
  }
  rep(i,D){
    rep(j,26){
      cin >> S[i][j];
    }
  }
}

int main(){
  input();
  const double LIMIT = 1975;
  PreP = Put_Score();
  bool Z=0;
  while(clock()<1975000){
    int a=xor128()%365;
    int b=xor128()%365;
    int p=ANS[a],q=ANS[b];
    if(p==q){
      continue;
    }
    ll AftP = Che_Score(a,b,p,q);
    //cout << AftP << endl;
    if(AftP>0){
      PreP+=AftP;
    }
    else{
      ANS[a]=p;
      ANS[b]=q;
    }
  }
  rep(i,D){
    cout << ANS[i]+1 << endl;
  }
}

Measured memory_bytes: 3648