import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto D = RD;
	auto c = RDA;
	auto s = new long[][](D);
	foreach (i; 0..D)
		s[i] = RDA;

	long computeDec(long i, long[] last)
	{
		long dec;
		foreach (j; 0..26)
		{
			dec += c[j] * (i - last[j]);
		}
		return dec;
	}

	long DEPTH_LIMIT = 5;
	long EDGE_SIZE = 4;
	long[] sim(long i, long[] last, long score, long sati, long depth)
	{
		auto dec = computeDec(i, last);

		BinaryHeap!(Array!(long[]), "a[0] > b[0]") heap;
		foreach (j; 0..26)
		{
			auto x = sati + s[i][j] + c[j] * (i - last[j]) - dec;
			auto y = score + max(10^^6+x, 0);
			if (heap.length < EDGE_SIZE)
				heap.insert([y, x, j]);
			else if (y > heap.front[0])
			{
				heap.popFront;
				heap.insert([y, x, j]);
			}
		}

		if (depth == DEPTH_LIMIT || i == D-1)
		{
			while (heap.length > 1)
				heap.removeFront;
			return heap.front;
		}
		else
		{
			long[] best = [0, 0, 0];
			while (!heap.empty)
			{
				auto nd = heap.front; heap.popFront;
				auto lastlast = last[nd[2]];
				last[nd[2]] = i;
				auto r = sim(i+1, last, nd[0], nd[1], depth+1);
				if (r[0] > best[0])
				{
					best = r;
				}
				last[nd[2]] = lastlast;
			}
			return best;
		}
	}

	long score, sati;
	auto last = new long[](26);
	foreach (i; 0..D)
	{
		auto dec = computeDec(i, last);
		auto r = sim(i, last, score, sati, 0);
		auto pos = r[2];
		sati += s[i][pos] + c[pos] * (i - last[pos]) - dec;
		score += max(10^^6+sati, 0);
		last[pos] = i;
		writeln(pos+1);
	}

	stdout.flush;
	debug readln;
}
