using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;

namespace AtCoderWorkspace
{
    public class Solver
    {
        int[] c;
        int[] last;
        int[,] sat;
        public void Solve()
        {
            var cin = new Scanner();
            var d = cin.nextInt();
            c = cin.ArrayInt(26);
            sat = new int[d, 26];
            last = new int[26];
            for (int i = 0; i < d; i++)
            {
                for (int j = 0; j < 26; j++)
                {
                    sat[i, j] = cin.nextInt();
                }
            }

            // 各日付から最大になるように貪欲
            var t = new LinkedList<int>();
            for (int i = 0; i < d; i++)
            {
                var tmpMax = long.MinValue;
                var tmpMaxi = 0;
                var tmpLast = 0;
                for (int j = 0; j < 26; j++)
                {
                    t.AddLast(j+1);
                    var tmpScore = getsat(t);
                    if(tmpMax < tmpScore)
                    {
                        tmpMax = tmpScore;
                        tmpMaxi = j+1;
                        tmpLast = j;
                    }
                    t.RemoveLast();
                    last[j] = 0;
                }
                t.AddLast(tmpMaxi);
                last[tmpLast] = i;
            }

            foreach (var item in t)
            {
                Console.WriteLine(item);
            }
        }

        /// <summary>
        /// O(10^4)
        /// </summary>
        /// <param name="t"></param>
        /// <returns></returns>
        long getsat(LinkedList<int> t)
        {
            var day = 1;
            var sum = 0;
            foreach (var type in t)
            {
                var score = sat[day - 1, type - 1];
                last[type - 1] = day;
                score -= (int)disat(day);
                sum += score;
                day++;
            }

            return sum;
        }

        long disat(int d)
        {
            var ret = 0L;
            for (int i = 0; i < 26; i++)
            {
                var co = c[i];
                var l = last[i];

                ret += co * (d - l);
            }
            return ret;
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}

Measured memory_bytes: 28880