#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;

using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;

constexpr int INF = 1e18;
constexpr int MOD = 1e9 + 7;

template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
int lower_index(T a, U i) { return lower_bound(all(a), i) - begin(a); } // use member func for set
template <class T, class U>
int upper_index(T a, U i) { return upper_bound(all(a), i) - begin(a); }
template <class T, class U>
bool binary(T a, U i) { return binary_search(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };

template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
  int c = v.size() - 1;
  for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
  if (c > -1) cout << v[c];
  cout << endl;
}

template <class T>
bool amin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool amax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

int ceil_div(int x, int y) { return (x - 1) / y + 1; }

#pragma endregion header

void solve(int D, vi c, vvi s) {
  int score = 0;
  vi last(26, -1);
  int pre_cnt = max(0ll, (D - 5));
  rep(i, pre_cnt) {
    int ans = 0, smax = -1;
    int costs = 0;
    rep(j, 26) costs += c[j] * (i - last[j]);
    rep(j, 26) {
      int sat = s[i][j] + c[j] * (i - last[j]);
      if(sat > smax) {
        ans = j;
        smax = sat;
      }
    }
    score += s[i][ans] + c[ans] * (i - last[ans]);
    score -= costs;
    last[ans] = i;
    COUT(ans + 1);
    // COUT(score);
  }
  int full_cnt = min(D, 5ll), full_max = -1;
  vi full_ans(full_cnt, 1);
  // vi full_ans;
  function<void(int, vi)> dfs = [&](int sum, vi cs) {
    int i = sz(cs);
    if(i == full_cnt) {
      if(sum > full_max){
        full_max = sum;
        full_ans = cs;
      }
    } else {
      rep(j, 26) {
        int j_last = last[j];
        rrep(k, i)if(cs[k] == j) {
          j_last = k + pre_cnt;
          break;
        }
        int next_sum = sum + s[i + pre_cnt][j] + c[j] * (i - j_last + pre_cnt);
        vi next_cs(all(cs));
        next_cs.push_back(j);
        dfs(next_sum, next_cs);
      }
    }
  };
  dfs(0, {});
  rep(i, pre_cnt, D) {
    int ans = 0, smax = -1;
    int costs = 0;
    rep(j, 26) costs += c[j] * (i - last[j]);
    ans = full_ans[i - pre_cnt];
    score += s[i][ans] + c[ans] * (i - last[ans]);
    score -= costs;
    last[ans] = i;
    COUT(ans + 1);
    // COUT(score);
  }
}


#pragma region main
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(15);

  int D;
  cin >> D;
  vi c(26);
  for(int i = 0 ; i < 26 ; i++){
    cin >> c[i];
  }
  vvi s(D, vi(26));
  for(int i = 0 ; i < D ; i++){
    for(int j = 0 ; j < 26 ; j++){
      cin >> s[i][j];
    }
  }
  solve(D, move(c), move(s));
}
#pragma endregion main


Measured memory_bytes: 3752