using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.CodeAnalysis;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Runtime.Intrinsics.X86;
using System.Text;
using System.Threading;

namespace AtCoder
{
	public class Program
	{
		static void Main()
		{
			var sw = new Stopwatch();
			sw.Start();

			var cin = new Scanner();
			int n = 26;
			int d = cin.Int();
			var c = cin.ArrayInt(n);
			var s = new int[d, n];
			for (int i = 0; i < d; i++) {
				for (int j = 0; j < n; j++) {
					s[i, j] = cin.Int();
				}
			}

			var t = new int[d];

			var hash = new HashSet<int>();
			for (int i = 0; i < d; i++) {
				int target = 0;
				int max = 0;
				for (int j = 0; j < n; j++) {
					if (hash.Contains(j)) {
						continue;
					}

					if (s[i, j] > max) {
						max = s[i, j];
						target = j;
					}
				}

				hash.Add(target);
				t[i] = target;

				if (hash.Count == n) {
					hash.Clear();
				}
			}

			long manzoku = CalculateManzoku(n, d, c, s, t);
			var rand = new Random();

			int l1 = 1000;
			int l2 = 10000;
			var swapInfos = new (int targetD1, int targetD2, long manzoku)[l1];
			var changeInfos = new (int targetD, int newType, long manzoku)[l2];
			while (sw.ElapsedMilliseconds <= 1850) {
				{
					for (int j = 0; j < 10; j++) {
						for (int i = 0; i < l1; i++) {
							int targetD1 = rand.Next(0, d - 1);
							int shift = rand.Next(-26, 26);
							int targetD2 = targetD1 + shift;
							targetD2 = Math.Max(0, targetD2);
							targetD2 = Math.Min(targetD2, d - 1);
							if (targetD1 == targetD2) {
								swapInfos[i] = (targetD1, targetD2, 0);
								continue;
							}

							long tempManzoku = Swap(d, c, s, t, targetD1, targetD2, manzoku);
							swapInfos[i] = (targetD1, targetD2, tempManzoku);
						}

						Array.Sort(swapInfos, (x, y) => y.manzoku.CompareTo(x.manzoku));
						var max = swapInfos[0];
						if (max.manzoku > manzoku) {
							int temp = t[max.targetD1];
							t[max.targetD1] = t[max.targetD2];
							t[max.targetD2] = temp;
							manzoku = max.manzoku;
						}
					}
				}

				{
					for (int i = 0; i < l2; i++) {
						int targetD = rand.Next(0, d - 1);
						int newType = rand.Next(0, n - 1);
						long tempManzoku = Change(d, c, s, t, targetD, newType, manzoku);

						changeInfos[i] = (targetD, newType, tempManzoku);
					}

					Array.Sort(changeInfos, (x, y) => y.manzoku.CompareTo(x.manzoku));
					var max = changeInfos[0];
					if (max.manzoku > manzoku) {
						t[max.targetD] = max.newType;
						manzoku = max.manzoku;
					}
				}
			}

			Console.WriteLine(string.Join(Environment.NewLine, t.Select(x => x + 1)));
		}

		static long CalculateManzoku(int n, int d, int[] c, int[,] s, int[] t)
		{
			var last = new int[n];
			long manzoku = 0;
			for (int i = 0; i < d; i++) {
				manzoku += s[i, t[i]];
				last[t[i]] = i + 1;
				for (int j = 0; j < n; j++) {
					manzoku -= c[j] * ((i + 1) - last[j]);
				}
			}

			return manzoku;
		}

		static long Change(
			int d, int[] c, int[,] s, int[] t, int targetD, int newType, long manzoku)
		{
			int oldType = t[targetD];
			manzoku += s[targetD, newType] - s[targetD, oldType];

			int CalcDiff(int type)
			{
				int count = 1;
				for (int i = targetD + 1; i < d; i++) {
					if (t[i] == type) {
						break;
					}

					++count;
				}

				int lastCount = 1;
				for (int i = targetD - 1; i >= 0; i--) {
					if (t[i] == type) {
						break;
					}

					++lastCount;
				}

				return count * lastCount * c[type];
			}

			manzoku -= CalcDiff(oldType);
			manzoku += CalcDiff(newType);

			//t[targetD] = newType;
			return manzoku;
		}

		static long Swap(
			int d, int[] c, int[,] s, int[] t, int targetD1, int targetD2, long manzoku)
		{
			int oldType1 = t[targetD1];
			int oldType2 = t[targetD2];
			manzoku = Change(d, c, s, t, targetD1, oldType2, manzoku);
			t[targetD1] = oldType2;
			manzoku = Change(d, c, s, t, targetD2, oldType1, manzoku);

			t[targetD1] = oldType1;
			t[targetD2] = oldType2;

			return manzoku;
		}

	}

	public struct ModInt
	{
		public const long P = 1000000007;
		//public const long P = 998244353;

		public static ModInt Inverse(ModInt value) => Pow(value, P - 2);
		public static ModInt Pow(ModInt value, long k) => Pow(value.value_, k);
		public static ModInt Pow(long value, long k)
		{
			long ret = 1;
			for (k %= P - 1; k > 0; k >>= 1, value = value * value % P) {
				if ((k & 1) == 1) {
					ret = ret * value % P;
				}
			}
			return new ModInt(ret);
		}

		private long value_;

		public ModInt(long value)
			=> value_ = value;
		public ModInt(long value, bool mods)
		{
			if (mods) {
				value %= P;
				if (value < 0) {
					value += P;
				}
			}

			value_ = value;
		}

		public static ModInt operator +(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = (lhs.value_ + rhs.value_) % P;
			return lhs;
		}
		public static ModInt operator +(long lhs, ModInt rhs)
		{
			rhs.value_ = (lhs + rhs.value_) % P;
			return rhs;
		}
		public static ModInt operator +(ModInt lhs, long rhs)
		{
			lhs.value_ = (lhs.value_ + rhs) % P;
			return lhs;
		}

		public static ModInt operator -(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = (P + lhs.value_ - rhs.value_) % P;
			return lhs;
		}
		public static ModInt operator -(long lhs, ModInt rhs)
		{
			rhs.value_ = (P + lhs - rhs.value_) % P;
			return rhs;
		}
		public static ModInt operator -(ModInt lhs, long rhs)
		{
			lhs.value_ = (P + lhs.value_ - rhs) % P;
			return lhs;
		}

		public static ModInt operator *(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = lhs.value_ * rhs.value_ % P;
			return lhs;
		}
		public static ModInt operator *(long lhs, ModInt rhs)
		{
			rhs.value_ = lhs * rhs.value_ % P;
			return rhs;
		}
		public static ModInt operator *(ModInt lhs, long rhs)
		{
			lhs.value_ = lhs.value_ * rhs % P;
			return lhs;
		}

		public static ModInt operator /(ModInt lhs, ModInt rhs)
		{
			long exp = P - 2;
			while (exp > 0) {
				if (exp % 2 > 0) {
					lhs *= rhs;
				}

				rhs *= rhs;
				exp /= 2;
			}

			return lhs;
		}

		public static implicit operator ModInt(long n) => new ModInt(n, true);
		public long ToLong() => value_;
		public override string ToString() => value_.ToString();
	}

	public class HashMap<TKey, TValue> : Dictionary<TKey, TValue>
	{
		private readonly Func<TKey, TValue> initialzier_;
		public HashMap(Func<TKey, TValue> initialzier)
			: base()
		{
			initialzier_ = initialzier;
		}

		public HashMap(Func<TKey, TValue> initialzier, int capacity)
			: base(capacity)
		{
			initialzier_ = initialzier;
		}

		new public TValue this[TKey key]
		{
			get
			{
				if (ContainsKey(key) == false) {
					base[key] = initialzier_(key);
				}

				return base[key];
			}

			set { base[key] = value; }
		}
	}

	public static class Helper
	{
		public static void UpdateMin<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) > 0 ? value : target;

		public static void UpdateMin<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) > 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static void UpdateMax<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) < 0 ? value : target;
		public static void UpdateMax<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) < 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static T[] Array<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToArray();
		public static List<T> List<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToList();
		public static T[,] Array2<T>(int n, int m, T init)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = init;
				}
			}

			return array;
		}

		public static T[,] Array2<T>(int n, int m, Func<int, int, T> initializer)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = initializer(i, j);
				}
			}

			return array;
		}

		public static T[,,] Array3<T>(int n1, int n2, int n3, T init)
		{
			var array = new T[n1, n2, n3];
			for (int i1 = 0; i1 < n1; i1++) {
				for (int i2 = 0; i2 < n2; i2++) {
					for (int i3 = 0; i3 < n3; i3++) {
						array[i1, i2, i3] = init;
					}
				}
			}

			return array;
		}

		private static readonly int[] delta4_ = { 1, 0, -1, 0, 1 };
		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static void DoAt4(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int dn = 0; dn < 4; dn++) {
				int d4i = i + delta4_[dn];
				int d4j = j + delta4_[dn + 1];
				if ((uint)d4i < (uint)imax && (uint)d4j < (uint)jmax) {
					action(d4i, d4j);
				}
			}
		}

		private static readonly int[] delta8_ = { 1, 0, -1, 0, 1, 1, -1, -1, 1 };
		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static void DoAt8(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int dn = 0; dn < 8; dn++) {
				int d8i = i + delta8_[dn];
				int d8j = j + delta8_[dn + 1];
				if ((uint)d8i < (uint)imax && (uint)d8j < (uint)jmax) {
					action(d8i, d8j);
				}
			}
		}
	}

	public class Scanner
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private readonly string filePath_;
		private readonly Func<string> reader_;
		private string[] buf_;
		private int index_;

		public Scanner(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}

		public string NextLine() => reader_();
		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = reader_();
			while (st == "") {
				st = reader_();
			}

			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());

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

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

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

		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}

			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}
}


Measured memory_bytes: 29072