#include <bits/stdc++.h>
#include <unistd.h>

#define fi first
#define se second
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define rep1(i,n) for (ll i = 1; i <= (n); ++i)
#define rrep(i,n) for (ll i = (n)-1; i >=0; --i)
#define ALL(a) a.begin(),a.end()
#define pb push_back
#define dame { puts("-1"); return 0;}
#define show(x) cerr<<#x<<" = "<<x<<endl;

using namespace std;
using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;

typedef vector<ll> vl;
typedef vector<pl> vp;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }


// 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 ll mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  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 { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} c(200005);

// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
  int n;
  vector<int> f, primes;
  Sieve(int n=1):n(n), f(n+1) {
    f[0] = f[1] = -1;
    for (ll i = 2; i <= n; ++i) {
      if (f[i]) continue;
      primes.push_back(i);
      f[i] = i;
      for (ll j = i*i; j <= n; j += i) {
        if (!f[j]) f[j] = i;
      }
    }
  }
  bool isPrime(int x) { return f[x] == x;}
  vector<int> factorList(int x) {
    vector<int> res;
    while (x != 1) {
      res.push_back(f[x]);
      x /= f[x];
    }
    return res;
  }
  vector<pl> factor(int x) {
    vector<int> fl = factorList(x);
    if (fl.size() == 0) return {};
    vector<pl> res(1, pl(fl[0], 0));
    for (int p : fl) {
      if (res.back().first == p) {
        res.back().second++;
      } else {
        res.emplace_back(p, 1);
      }
    }
    return res;
  }
  vector<pair<ll,int>> factor(ll x) {
    vector<pair<ll,int>> res;
    for (int p : primes) {
      int y = 0;
      while (x%p == 0) x /= p, ++y;
      if (y != 0) res.emplace_back(p,y);
    }
    if (x != 1) res.emplace_back(x,1);
    return res;
  }
};

using data = pair<ll, vector<ll> >;
ll LINF = 1000000000000000000;

map<ll, ll> m;


ll fff(ll n){
  if(n==1) return 1;
  if(m[n]>0) return m[n];
  for(ll i=ll(sqrt(n))+1;i>1;i--){
    if(n<=i) continue;
    if(n%i==0){
      // ll j = i;
      // ll idx = 2;
      // while(n%(j*i)==0){
      // 	j*=i;
      // 	idx++;
      // }
      return m[n] = fff(i) * fff(n/i) ;
    }
  }
  return m[n] = 2;
}

int main() {
  ll D;
  cin  >> D;

  vector<ll> c(26);
  vector<vector<ll> > s(D, vector<ll>(26) );
  
  rep(i, 26) cin >> c[i];

  rep(i, D){
    rep(j, 26) cin >> s[i][j];
  }

  vector<ll> t(D);

  // rep(i, D) {
  //   cin >> t[i];
  //   t[i]--;
  // }

  ll last[26];
  rep(i, 26) last[i] = 0;

  ll ans = 0;
  ll human;

  ll tmp;
  ll kai = 1;
  ll tmp_ans = 0;
  rep(day, D-1){
    tmp = -10000000000000;
    kai =1;
    rep(i, 26){
      ans += s[day][i];
      rep(j, 26){
	human = 0;
      
	ans += s[day+1][j];
	
	rep(alpha, 26) {
	  if(alpha==i && alpha !=j) human += c[alpha] * (day+1-last[alpha]) ;
	  if(alpha!=j) human += c[alpha] * (day + 2 - last[alpha]);
	}
	
	if(tmp<ans-human){
	  kai = i+1;
	  tmp = ans - human;
	  tmp_ans = s[day][i];
	}
	ans -= s[day+1][j];
      }
      ans -= s[day][i];
    }
    //cout << ans - human << endl;
    cout <<kai << endl;
    ans += tmp_ans;
    last[kai-1] = day;
  }


  tmp = -10000000000;
  ans = 10000000;
  rep(i, 26){
    
    human = 0;
    ans += s[D-1][i];
    
    rep(alpha, 26) {
	if(alpha!=i) human += c[alpha] * (D-1 + 1 - last[alpha]);
    }
    if(tmp<ans-human){
      kai = i+1;
      tmp = ans - human;
      tmp_ans = s[D-1][i];
    }
    ans -= s[D-1][i];
  }
  cout << kai << endl;
  
  return 0;
}


Measured memory_bytes: 6264