//#define NDEBUG
#include "bits/stdc++.h"
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <random>
#ifdef _MSC_VER
#include <ppl.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/rational.hpp>
//#include <opencv2/core.hpp>
//#include <opencv2/imgproc.hpp>
//#include <opencv2/highgui.hpp>
//#else
//#include <omp.h>
#endif


using namespace std;

#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

using uint = unsigned; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using pss = pair<string, string>;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const deque<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; }	o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}";	return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t t = 0; t < v.size(); t++) is >> v[t]; return is; }
template <typename _Ty> istream& operator >> (istream& is, deque<_Ty>& v) { for (size_t t = 0; t < v.size(); t++) is >> v[t]; return is; }
namespace aux { // print tuple
  template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
  template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}

template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T& val) { fill((T*)array, (T*)(array + N), val); }

template <typename ... Args>
std::string format(const std::string& fmt, Args ... args) {
  size_t len = std::snprintf(nullptr, 0, fmt.c_str(), args ...);
  std::vector<char> buf(len + 1);
  std::snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
  return std::string(&buf[0], &buf[0] + len);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-8
#define rep(t,n) for(int t=0;t<(n);++t)
#define ALL(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

class Timer {
public:
  double t = 0;
  Timer() {}
  static double time() {
#ifdef _MSC_VER
    return __rdtsc() / 2.8e9;
#else
    unsigned long long a, d;
    __asm__ volatile("rdtsc"
      : "=a"(a), "=d"(d));
    return (d << 32 | a) / 3.0e9;
#endif
  }
  void measure() { t = time() - t; }
  double elapsedMs() { return (time() - t) * 1000.0; }
} timer;

struct Xorshift {
  uint64_t x = 88172645463325252LL;
  unsigned next_int() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  unsigned next_int(unsigned mod) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % mod;
  }
  unsigned next_int(unsigned l, unsigned r) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % (r - l + 1) + l;
  }
  double next_double() {
    return double(next_int()) / UINT_MAX;
  }
} rnd;

template<typename T>
void shuffle_vector(vector<T>& v, Xorshift& rnd) {
  int n = v.size();
  for (int i = n - 1; i >= 1; i--) {
    int r = rnd.next_int(i);
    swap(v[i], v[r]);
  }
}



constexpr int N = 26;
constexpr int D = 365;
int c[N];
int s[D + 1][N];

struct State {
  int day;
  int score;
  int last[N];
  int t[D];
  State() {}
  void init() {
    day = 0;
    score = 0;
    rep(i, N) last[i] = -1;
  }
  int calc_diff(int i) {
    int diff = 0, p;
    diff += s[day][i];
    p = last[i];
    last[i] = day;
    for (int k = 0; k < N; k++)
      diff -= c[k] * (day - last[k]);
    last[i] = p;
    return diff;
  }
  void choose_greedy() {
    int best_diff = INT_MIN, best_i = -1;
    for (int i = 0; i < N; i++) {
      int diff = calc_diff(i);
      if (best_diff < diff) {
        best_diff = diff;
        best_i = i;
      }
    }
    score += best_diff;
    last[best_i] = day;
    t[day] = best_i;
    day++;
  }
  void output(ostream& o) {
    rep(d, D) o << t[d] + 1 << '\n';
  }
};

struct State2 {
  int t[D];
  set<int> contest_to_days[N];
  int score;
  State2() {}
  void init(const State& state) {
    score = 0;
    rep(i, N) {
      contest_to_days[i].insert(-1);
      contest_to_days[i].insert(D);
    }
    rep(d, D) {
      t[d] = state.t[d];
      contest_to_days[state.t[d]].insert(d);
    }
    int cnt = 0;
    rep(i, N) {
      int prev = -1;
      for (auto it = contest_to_days[i].begin(); it != contest_to_days[i].end(); ++it) {
        if (*it == -1) continue;
        cnt++;
        score += s[*it][i];
        int l = *it - prev - 1;
        score -= c[i] * l * (l + 1) / 2;
        prev = *it;
      }
    }
  }
  int erase_diff(int d) const {
    // d 日目を消したときの差分
    int diff = 0;
    int i = t[d];
    diff -= s[d][i];
    auto it = contest_to_days[i].find(d);
    int pd = *std::prev(it), nd = *std::next(it);
    int l1 = d - pd - 1;
    int l2 = nd - d - 1;
    int l = nd - pd - 1;
    diff += c[i] * l1 * (l1 + 1) / 2;
    diff += c[i] * l2 * (l2 + 1) / 2;
    diff -= c[i] * l * (l + 1) / 2;
    return diff;
  }
  int insert_diff(int d, int i) const {
    int diff = 0;
    diff += s[d][i];
    auto it = contest_to_days[i].upper_bound(d);
    int pd = *std::prev(it), nd = *it;
    int l1 = d - pd - 1;
    int l2 = nd - d - 1;
    int l = nd - pd - 1;
    diff += c[i] * l * (l + 1) / 2;
    diff -= c[i] * l1 * (l1 + 1) / 2;
    diff -= c[i] * l2 * (l2 + 1) / 2;
    return diff;
  }
  int change_diff(int d, int i) const {
    // d 日目のコンテストを t[d] -> i に変更するコスト
    return erase_diff(d) + insert_diff(d, i);
  }
  void change(int d, int i, int diff) {
    int pi = t[d];
    contest_to_days[pi].erase(d);
    contest_to_days[i].insert(d);
    t[d] = i;
    score += diff;
  }
  void output(ostream& o) {
    rep(d, D) o << t[d] + 1 << '\n';
  }
};

double getTemp(double startTemp, double endTemp, double t, double T) {
  return endTemp + (startTemp - endTemp) * (T - t) / T;
}

int main() {
  timer.measure();

  ios::sync_with_stdio(false);
  cin.tie(0);

  //ifstream ifs("C:\\Users\\komori3\\Desktop\\6f4c9d0cfda6a311fea2d9cf23e4f032\\tester\\in1.txt");
  //istream& in = ifs;
  //ofstream ofs("C:\\Users\\komori3\\Desktop\\6f4c9d0cfda6a311fea2d9cf23e4f032\\tester\\out1.txt");
  //ostream& out = ofs;
  istream& in = cin;
  ostream& out = cout;

  string buf;
  in >> buf;
  rep(i, N) in >> c[i];
  rep(d, D) rep(i, N) in >> s[d][i];

  vector<int> v(D);
  for (int i = 0; i < D; i++) v[i] = i % 26;

  State best_state;
  int best_score = INT_MIN;
  
  best_state.init();
  rep(d, D) best_state.choose_greedy();
  best_score = best_state.score;

  //dump(best_score);

  //best_state.output(out);

  State2 state2;
  state2.init(best_state);

  double start = timer.elapsedMs();
  double end = 1900;
  const unsigned RR = (1 << 30), mask = (1 << 30) - 1;
  int loop = 0;
  while (timer.elapsedMs() < end) {
    int d = rnd.next_int(D), i;
    do {
      i = rnd.next_int(N);
    } while (i == state2.t[d]);

    int diff = state2.change_diff(d, i);

    double temp = getTemp(1000, 1, timer.elapsedMs() - start, end - start);
    double prob = exp(diff / temp);
    if (RR * prob > (rnd.next_int() & mask)) {
      state2.change(d, i, diff);
    }
    loop++;
    if (loop % 1000000 == 0) {
      dump(loop, state2.score);
    }
  }
  dump(state2.score);

  state2.output(out);

  return 0;
}


Measured memory_bytes: 4352