using System;
using System.Collections.Generic;
using static Assistant.Input;
using static Assistant.Debug;
using System.Linq;
using Assistant;

namespace IntroductionOfHeuristicsContestA
{
    class Program
    {
        static void Main(string[] args)
        {
#if RELEASE
            D = RInt;
            c = RInts;

            s = new int[D][].Select(x => new int[26]).ToArray();
            for (int i = 0; i < D; i++)
            {
                var input = RInts;
                for (int j = 0; j < input.Length; j++)
                {
                    s[i][j] = input[j];
                }
            }

#endif
            DateTime start = DateTime.Now;
#if DEBUG
            D = 365;
            c = Gen(100, 26);
            Draw1D(c);
            s = new int[D][].Select(x => new int[26]).ToArray();
            for (int i = 0; i < D; i++)
            {
                s[i] = Gen(20000, 26);
                Draw1D(s[i]);
            }
#endif
            int[] last = new int[26].Select(x => -1).ToArray();

            List<int> ans = new List<int>();
            for (int i = 0; i < D; i++)
            {
                int[] minusArr = new int[26];
                for (int j = 0; j < c.Length; j++)
                {
                    minusArr[j] = c[j] * (i - last[j]);
                }

                int select = maxIndex(minusArr);
                if (minusArr.Sum() < s[i].Max())
                {
                    select = maxIndex(s[i]);
                }

                last[select] = i;

                ans.Add(select + 1);
            }

            int[] cand = ans.ToArray();
            long score = CalcScore(cand, 365);
            Random r = new Random();

            int c1 = 0;
            int c2 = 0;
            while ((DateTime.Now - start).TotalMilliseconds < 1900)
            {
                c1++;
                int i1 = r.Next(0, 365);

                int b1 = cand[i1];
                cand[i1] = r.Next(1, 26);

                long sco = CalcScore(cand, 50);
                if (sco > score)
                {
                    c2++;
                    score = sco;
                }
                else
                {
                    cand[i1] = b1;
                }
            }

            foreach (var a in cand)
            {
                Console.WriteLine(a);
            }
#if DEBUG
            Console.WriteLine(score);
            Console.WriteLine(c1); // 更新率
            Console.WriteLine(c2); // 更新率
#endif
        }

        static int D;
        static int[] c;
        static int[][] s;
        static long CalcScore(int[] ans, int fin)
        {
            long score = 0;
            int[] last = new int[26];
            for (int i = 0; i < D; i++)
            {
                int select = ans[i] - 1;
                last[select] = i;

                score += s[i][select];
                for (int j = 0; j < c.Length; j++)
                {
                    score -= c[j] * (i - last[j]);
                }
                if (i >= fin && score < -1000000) return 0;
            }
            score += 1000000;

            return score;
        }

        static int maxIndex(int[] arr)
        {
            int index = 0;
            int max = 0;
            for (int i = 0; i < arr.Length; i++)
            {
                if (max < arr[i])
                {
                    index = i;
                    max = arr[i];
                }
            }

            return index;
        }

        static int[] Gen(int max, int count)
        {
            int[] ret = new int[count];
            for (int i = 0; i < count; i++)
            {
                Random r = new Random();
                ret[i] = r.Next(0, max);
            }

            return ret;
        }
    }


}

namespace Assistant
{
    static class Input
    {
        static List<string> line = new List<string>();
        static int index = 0;
        static String RNext()
        {
            if (line.Count <= index) line.AddRange(Console.ReadLine().Split());
            return line[index++];
        }
        public static int RInt => int.Parse(RNext());
        public static long RLong => long.Parse(RNext());
        public static int[] RInts => Console.ReadLine().Split().Select(int.Parse).ToArray();
        public static long[] RLongs => Console.ReadLine().Split().Select(long.Parse).ToArray();
        public static string RString => RNext();
        //以下未テスト
        public static int[] RIntsC(int c) => Enumerable.Repeat(0, c).Select(x => int.Parse(RNext())).ToArray();
        public static long[] RLongsC(int c) => Enumerable.Repeat(0, c).Select(x => long.Parse(RNext())).ToArray();
        public static char[][] RMap(int h) => Enumerable.Repeat(0, h).Select(x => Console.ReadLine().ToCharArray()).ToArray();
    }

    public struct Mlong
    {
        long _v;
        const long mod = 1000000007;
        public Mlong(long n = 0) : this() { _v = n >= mod ? n % mod : n; }

        public static implicit operator Mlong(long _x) => new Mlong(_x);
        public static implicit operator long(Mlong _x) => _x._v;
        public static Mlong operator +(Mlong m1, Mlong m2) { long m = m1._v + m2._v; return m >= mod ? m - mod : m; }
        public static Mlong operator -(Mlong m1, Mlong m2) { long m = m1._v - m2._v; return m >= 0 ? m : m + mod; }
        public static Mlong operator *(Mlong m1, Mlong m2) => m1._v * m2._v % mod;
        public static Mlong operator /(Mlong m1, Mlong m2) => m1._v * ModPow(m2._v, mod - 2) % mod;

        public static long ModPow(long a, long n)
        {
            if (n == 0) return 1;
            else if (n % 2 == 1) return a * ModPow(a, n - 1) % mod;
            else return ModPow(a * a, n / 2);
        }

        static Mlong[] fac, finv, inv;
        public static void nCkInit(int max)
        {
            fac = new Mlong[max]; finv = new Mlong[max]; inv = new Mlong[max];
            fac[0] = fac[1] = 1;
            finv[0] = finv[1] = 1;
            inv[1] = 1;
            for (int i = 2; i < max; i++)
            {
                fac[i] = fac[i - 1] * i;
                inv[i] = mod - inv[mod % i] * (mod / i);
                finv[i] = finv[i - 1] * inv[i];
            }
        }

        public static Mlong nCk(int n, int k)
        {
            if (n < k) return 0;
            if (n < 0 || k < 0) return 0;
            return fac[n] * finv[k] * finv[n - k];
        }
    }

    static class Debug
    {
        static public void Draw2D<T>(T[,] map, int mode = 1)
        {
#if DEBUG
            int W = map.GetLength(0);
            int H = map.GetLength(1);

            string[,] map2 = new string[W + 1, H + 1];
            for (int i = 0; i < W + 1; i++)
            {
                for (int j = 0; j < H + 1; j++)
                {
                    if (i == 0 && j == 0) map2[i, j] = 0.ToString();
                    else if (i == 0) map2[i, j] = (j - 1).ToString();
                    else if (j == 0) map2[i, j] = (i - 1).ToString();
                    else map2[i, j] = map[i - 1, j - 1].ToString();
                }
            }

            for (int i = 0; i < W + 1; i++)
            {
                for (int j = 0; j < H + 1; j++)
                {
                    if (mode == 0) Console.Write(map2[i, j].Last());
                    if (mode == 1) Console.Write(map2[i, j] + " ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
#endif
        }

        public static void Draw1D<T>(T[] array, int mode = 0)
        {
#if DEBUG
            Console.WriteLine(string.Join(" ", array));
#endif
        }
    }
}


Measured memory_bytes: 49468