#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::multiprecision;

# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){cout << (v[i]) << " ";} cout << endl;
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;

template<class T>
using MaxHeap = std::priority_queue<T>;

template<class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<class T>
vector<T> make_vec(size_t a){
    return vector<T>(a);
}

template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}

int pop_count(int n){
  return __builtin_popcount(n);
}

int pop_count(ll n){
  return __builtin_popcountll(n);
}

ll lcm(ll a, ll b){
    ll g = gcd(a,b);
    return (a/g)*b;
}

// 素数判定 O(√n)
bool is_prime(ll n){
    if(n == 1) return false;
    for(ll i = 2; i * i <= n; i++){
        if(n % i == 0) return false;
    }
    return true;
}

// 約数列挙 O(√n)
vector<ll> divisor(ll n){
    vector<ll> res;
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n / i) res.push_back(n / i);
        }
    }
    return res;
}

template<typename T>
map<T, ll> prime_factorize(T x){
  map<T, ll> res;
  if(x == 0) return res;
  while(x%2==0){
    x/=2;
    res[2]++;
  }
  for(ll i=3;i*i<=x;i+=2){
    while(x%i==0){
      x/=i;
      res[i]++;
    }
  }
  if(x!=1) res[x]++;
  return res;
}

// エラトステネスの篩
// return lp[i] := iの最小素因数(lp[i] == iならば素数)
vector<int> SieveOfEratosthenes(int N = 10000000){
  vector<int> lp(N + 1, 0);
  vector<int> pr;
  for (int i=2; i<=N; ++i) {
      if (lp[i] == 0) {
          lp[i] = i;
          pr.push_back(i);
      }
      for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
          lp[i * pr[j]] = pr[j];
  }
  return lp;
}


// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x(x%mod){}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res*=a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const {
    return pow(mod-2);
  }
  mint& operator/=(const mint a) {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const {
    mint res(*this);
    return res/=a;
  }
};

const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;

ll intceil(ll a, ll b){
    if(a < 0){
      a *= -1;
      b *= -1;
    }
    if(b >= 0) return (a + b - 1 ) / b;
    return a / b;
}

ll intfloor(ll a, ll b){
    if(a < 0){
      a *= -1;
      b *= -1;
    }
    if(b >= 0) return a / b;
    return (a - b + 1) / b;
}

void addM(ll &a, ll b) {
    a += b;
    if (a >= MOD) a -= MOD;
}

void mulM(ll &a, ll b) {
    a = ((a%MOD)*(b%MOD))%MOD ;
}

ll powM(ll a,ll b) {
    ll ret = 1;
    ll tmp = a;
    while(b>0) {
        if((b&1)==1) ret = (ret * tmp) % MOD;
        tmp = (tmp * tmp) % MOD;
        b = b >> 1;
    }
    return ret;
}

// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

// ラングレンス圧縮
vector<pair<char, int>> rang_com(string s){
  vector<pair<char, int>> ret;
  string t = s;
  t.erase(unique(all(t)), t.end());
  int now = 0;
  int pre = 0;
  for(auto ct : t){
    while(now < s.size() && s[now] == ct) now++;
    if(ret.size() == 0){
      ret.push_back({ct, now});
    } else {
      ret.push_back({ct, now - pre});
    }
    pre = now;
  }
  return ret;
}

ll mypow(ll a, ll t) {
  if (!t) return 1;
  ll ret = mypow(a, t>>1);
  ret *= ret;
  if (t&1) ret *= a;
  return ret;
}

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);  

  clock_t start = clock();

  int d;
  cin >> d;

  ll c[26];
  REP(i, 26) cin >> c[i];

  ll s[d][26];
  REP(i, d) REP(j, 26) cin >> s[i][j];

  ll ans[d];
  ll score = 0;
  ll pre[26];
  REP(i, 26) pre[i] = 0;

  set<int> se[26];
  REP(i, 26) {
    se[i].insert(0);
    se[i].insert(d+1);
  }
  // 初期解の設定
  REP(i, d) {
    ll tmp1 = -longinf;
    ll k = 0;
    REP(j, 26){
      ll tmp2 = score + s[i][j];
      REP(l, 26){
        if(j != l){
          tmp2 -= c[l] * ((i+1) - pre[l]);
        }
      }
      if(chmax(tmp1, tmp2)){
        k = j;
      }
    }
    score = tmp1;
    pre[k] = i+1;
    ans[i] = k;
    se[k].insert(i+1);
  }

  std::mt19937 mt{ std::random_device{}() };
  std::uniform_int_distribution<int> dist_i(0, d-1);
  std::uniform_int_distribution<int> dist_t2(0, 26-1);
  while(1){
    clock_t end = clock();
    const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
    if(time >= 1.96) break;

    // 変更対象
    int i = dist_i(mt);
    // 変更先
    int t2 = dist_t2(mt);

    int t1 = ans[i];

    if(t1 == t2){
      continue;
    }

    ll new_score = score;
    new_score -= s[i][t1]; // 元得点のキャンセル
    new_score += s[i][t2]; // 新得点の追加

    // 元々の満足度降下のキャンセル
    int pre = 0;
    for(auto ite = se[t1].begin(); ite != se[t1].end(); ite++){      
      ll len = *ite - pre - 1;
      new_score += c[t1] * (len * (len+1)) / 2LL;
      pre = *ite;
    }
    pre = 0;
    for(auto ite = se[t2].begin(); ite != se[t2].end(); ite++){
      ll len = *ite - pre - 1;
      new_score += c[t2] * (len * (len+1)) / 2LL;
      pre = *ite;
    }

    se[t1].erase(se[t1].find(i+1));
    se[t2].insert(i+1);

    pre = 0;
    for(auto ite = se[t1].begin(); ite != se[t1].end(); ite++){      
      ll len = *ite - pre - 1;
      new_score -= c[t1] * (len * (len+1)) / 2LL;
      pre = *ite;
    }
    pre = 0;
    for(auto ite = se[t2].begin(); ite != se[t2].end(); ite++){
      ll len = *ite - pre - 1;
      new_score -= c[t2] * (len * (len+1)) / 2LL;
      pre = *ite;
    }

    // スコアが大きくなるならば、更新
    if(chmax(score, new_score)){
      ans[i] = t2;
    } else {
      se[t2].erase(se[t2].find(i+1));
      se[t1].insert(i+1);      
    }
  }

  // 結果の出力
  for(int a : ans){
    cout << a+1 << "\n";
  }

  return 0;
}

Measured memory_bytes: 3792