#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <set>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }
};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

struct Input {
  size_t D = 0;
  std::array<i32, 26> lose = {};
  std::vector<std::array<i32, 26>> gain;
};

struct Output {
  std::vector<i32> plan;
};

Input input;

i32 evaluate(const Output &out, const size_t days_after) {
  assert(out.plan.size() <= input.D);
  std::array<i32, 26> last = {};
  const auto lose_sum = std::accumulate(input.lose.begin(), input.lose.end(), i32(0));
  i32 score = 0, lose_cur = 0;
  for (auto i: range(0, out.plan.size())) {
    score += input.gain[i][out.plan[i]];
    lose_cur += lose_sum;
    lose_cur -= ((i + 1) - last[out.plan[i]]) * input.lose[out.plan[i]];
    last[out.plan[i]] = i + 1;
    score -= lose_cur;
  }
  for (auto i: range(out.plan.size(), std::min(out.plan.size() + days_after, input.D))) {
    lose_cur += lose_sum;
    score -= lose_cur;
  }
  return score;
}

Output find_optimal(const size_t days_after) {
  std::vector<Output> cand;
  cand.resize(21, Output{});
  for (auto i: range(0, input.D)) {
    std::vector<std::pair<i32, Output>> next;
    for (auto &x: cand) {
      for (auto k: range(0, 26)) {
        x.plan.push_back(k);
        next.emplace_back(evaluate(x, days_after), x);
        x.plan.pop_back();
      }
    }
    std::sort(next.begin(), next.end(), [&](const auto &x, const auto &y) {
      return x.first > y.first;
    });
    for (auto i: range(0, 21)) {
      cand[i] = std::move(next[i].second);
    }
  }
  return cand[0];
}

void solve() {
  i32 score = -inf32;
  Output out;
  for (auto k: range(0, 27)) {
    auto tmp = find_optimal(k);
    if (chmax(score, evaluate(tmp, 0))) {
      out = std::move(tmp);
    }
  }
  for (const auto x: out.plan) {
    std::cout << x + 1 << '\n';
  }
}

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cin >> input.D;
  for (auto &x: input.lose) {
    std::cin >> x;
  }
  input.gain.resize(input.D);
  for (auto &arr: input.gain) {
    for (auto &x: arr) {
      std::cin >> x;
    }
  }
  solve();
  return 0;
}


Measured memory_bytes: 4844