package main

import (
	"bufio"
	"fmt"
	"math"
	"math/rand"
	"os"
	"time"
	"strconv"
	"strings"

	"flag"
	"runtime"
	"runtime/pprof"
)

// TODO: 総当り方式の関数

var magic = 1000000007

var cpuprofile = flag.String("cpuprofile", "", "write cpu profile to file")
var memprofile = flag.String("memprofile", "", "write mem profile to file")

// func calc() {

// }

func solve() {
	io := NewIo()
	defer io.Flush()

	start := time.Now()

	// PARSE HELPER SESSION

	// STR := io.Next()
	// Log("string", STR)

	// F := io.NextFloat()
	// Log("float", F)

	// parsing int array
	D := io.NextInt()
	Logf("%v\n", D)
	var c [200000]int
	for i := 0 ; i < 26; i++ {
		c[i] = io.NextInt()
	}
	Logf("c %v\n", c[0:10])
	// sort.Sort(sort.Reverse(sort.IntSlice(A[:])))
	// sort.Sort(sort.IntSlice(A[:]))

	var s [365][26]int

	for j := 0 ; j < D; j++ {
		for i := 0 ; i < 26; i++ {
			s[j][i] = io.NextInt()
		}
	}
	Logf("s[0]: %v\n", s[0])

	var last [26]int
	var ans [365]int
	var t [365]int

	generator := rand.New(rand.NewSource(time.Now().UnixNano()))
	maxpoint := 0

	for {
		break  // debug
		ntime := time.Since(start)
		if ntime.Nanoseconds() > 1900000000 {
			break
		}
		for i := 0; i < D; i++ {
			t[i] = generator.Intn(26)
		}
		point := 0
		for i := 0; i < D; i++ {
			point += s[i][t[i]]
			for j := 0; j < 26; j++ {
				if j == t[i] {
					continue
				}
				point -= c[j]*(i - last[j])
			}
			last[t[i]] = i
		}
		// Logf("%v %v\n", i, point)
		if point > maxpoint {
			Logf("%v -> %v\n", maxpoint, point)
			maxpoint = point
			for k := 0; k < D; k++ {
				ans[k] = t[k]
			}
		}
	}

	for i := 0; i < D; i++ {
		maxchange := -100000000000
		candidate := 0
		maxloss := 0
		maxlosspos := 0
		for k := 0; k < 26; k++ {
			if maxloss < c[k]*(i-last[k]) {
				maxloss = c[k]*(i-last[k])
				maxlosspos = k
			}
		}

		for j := 0; j < 26; j++ { // j: contest
			change := s[i][j]
			for k := 0; k < 26; k++ {
				if k == j {
					continue
				}
				change -= c[k]*(i-last[k])
			}
			if maxchange < change {
				// Logf("%v %v, %v -> %v\n", i, j, maxchange, change)
				candidate = j
				maxchange = change
			}
		}

		if maxloss > maxchange {
			candidate = maxlosspos
		}

		ans[i] = candidate
		last[candidate] = i
		Logf("%v %v\n", i, candidate)
	}

	Logf("%v\n", ans[0:D])
	for i := 0; i < D; i++ {
		fmt.Printf("%v\n", ans[i]+1)
	}

	// parsing string as byte array
	// var s [10000]byte
	// var si [10000]int
	// str := io.Next()
	// for i := 0; i < len(str); i++ {
	// 	s[i] = str[i]
	//  // "0" = 48, "A" = 65, "a" = 97
	//  si[i] = int(str[i]) - 48
	// }
	// Log("byte array", s[0:10])

	// OUTPUT GENERATION PART
	// ans := 0
	// fmt.Printf("%v\n", ans)

	// if ans > 0 {
	//   fmt.Printf("Yes\n")
	// } else {
	//   fmt.Printf("No\n")
	// }

	// BFS/DFS PART
	// visited := []int{}
	// bfs/dfs(1, neighbor, func(node int) {
	// 	visited = append(visited, node)
	// })
	// fmt.Println(visited)

	// DFS 2
	// var dp [2000000]int
	// nei := make(map[int][]int)
	// nei[0] = []int{1, 2}
	// nei[1] = []int{0}
	// nei[2] = []int{0, 3}
	// nei[3] = []int{2}
	// dfs2(0, nei, func(n, p int) {
	// 	Logf("%v -> %v\n", p, n)
	// 	dp[n] = p
	// }, func(n, p int) {
	// 	Logf("%v -> %v\n", n, p)
	// })
	// Logf("%v\n", dp[0:5])

	// COMBINATION
	// fmt.Printf("%d %d %d\n", N, M, intMax(N, M))
	// fmt.Printf("Lucas %d %d\n", combMod(N, M, 13), combination(N, M))
}

func main() {
	flag.Parse()
	if *cpuprofile != "" {
		f, err := os.Create(*cpuprofile)
		if err != nil {
			Logf("%v\n", err)
			os.Exit(1)
		}
		pprof.StartCPUProfile(f)
		defer pprof.StopCPUProfile()
	}

	solve()

	if *memprofile != "" {
		f, err := os.Create(*memprofile)
		if err != nil {
			Logf("could not create memory profile: ", err)
			os.Exit(1)
		}
		defer f.Close() // error handling omitted for example
		runtime.GC() // get up-to-date statistics
		if err := pprof.WriteHeapProfile(f); err != nil {
			Logf("could not write memory profile: ", err)
			os.Exit(1)
		}
	}
}

// Libraries

// Io helps parsing inputs from standard input for programming contest.
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

// NewIo generates Io instance.
func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

// Flush flushes buffer. Don't forget to do this when you call Io.Printf/Io.PrintLn for final output.
func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

// NextLine parses line as string.
func (io *Io) NextLine() string {
	var buffer []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buffer = append(buffer, line...)
		if !isPrefix {
			break
		}
	}
	return string(buffer)
}

// Next parse next word as string.
func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	r := io.tokens[io.nextToken]
	io.nextToken++
	return r
}

// NextInt parse next word as Int.
func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

// NextFloat parses next word as float64.
func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

// PrintLn does buffer write with linefeed.
func (io *Io) PrintLn(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

// Printf does formatted buffer write.
func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

// PrintIntLn prints Int array in a single line.
func (io *Io) PrintIntLn(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.PrintLn(b...)
}

// PrintStringLn prints string array in a single line.
func (io *Io) PrintStringLn(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.PrintLn(b...)
}

// Log print single value to standard output (contest server ignores this so you don't have to remove when finishing)
func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

// Logf print formatted output to standard output (contest server ignores this so you don't have to remove when finishing)
func Logf(format string, a ...interface{}) {
	fmt.Fprintf(os.Stderr, format, a...)
}

func intMin(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func intMax(a, b int) int {
	if a > b {
		return a
	}
	return b
}

// direct calculation of combination
// n, m should be "small"
func combination(n, m int) int {
	if m > n {
		return 0
	} else if m == n || m == 0 {
		return 1
	} else {
		res := 1
		for i := 0; i < m; i++ {
			res *= (n - i)
		}
		for i := 1; i <= m; i++ {
			res /= i
		}
		return res
	}
}

// caluclate combination modulo based on Lucas theorem
func lucas(n, m, p int) int {
	ntemp := n
	mtemp := m
	res := 1
	for i := 0; i < 100; i++ {
		// fmt.Printf("ntemp: %d\n", ntemp)
		nreminder := ntemp % p
		ntemp = ntemp / p
		mreminder := mtemp % p
		mtemp = mtemp / p
		res = res * (combination(nreminder, mreminder) % p)
		if ntemp == 0 {
			break
		}
	}
	return res % p
}

func combMod(n, m, p int) int {
	return lucas(n, m, p)
}

func bfs(start int, nodes map[int][]int, fn func(int)) {
	frontier := []int{start}
	visited := map[int]bool{}

	for 0 < len(frontier) {
		next := []int{}
		for _, node := range frontier {
			visited[node] = true
			fn(node)
			for _, n := range bfsFrontier(node, nodes, visited) {
				next = append(next, n)
			}
		}
		frontier = next
	}
}

func bfsFrontier(node int, nodes map[int][]int, visited map[int]bool) []int {
	next := []int{}
	iter := func(n int) bool { _, ok := visited[n]; return !ok }
	for _, n := range nodes[node] {
		if iter(n) {
			next = append(next, n)
		}
	}
	return next
}

func dfs(node int, nodes map[int][]int, fn func(int)) {
	dfsRecur(node, nodes, map[int]bool{}, fn)
}

func dfsRecur(node int, nodes map[int][]int, v map[int]bool, fn func(int)) {
	v[node] = true
	fn(node)
	for _, n := range nodes[node] {
		if _, ok := v[n]; !ok {
			dfsRecur(n, nodes, v, fn)
		}
	}
}

// handles 2 function, one is before entering child tree, and another is
// after entering child tree.
func dfs2(node int, nodes map[int][]int, fn1, fn2 func(int, int)) {
	dfs2Recur(node, -1, nodes, map[int]bool{}, fn1, fn2)
}

func dfs2Recur(node, parent int, nodes map[int][]int, v map[int]bool, fn1, fn2 func(int, int)) {
	v[node] = true
	if fn1 != nil {
		fn1(node, parent)
	}
	for _, n := range nodes[node] {
		if _, ok := v[n]; !ok {
			dfs2Recur(n, node, nodes, v, fn1, fn2)
		}
	}
	if fn2 != nil {
		fn2(node, parent)
	}
}

// Stack data structure
type Stack struct {
	top  *Element
	size int
}

// Element is a struct for stack element
type Element struct {
	value interface{}
	next  *Element
}

// Len returns stack height
func (s *Stack) Len() int {
	return s.size
}

// Push put a element on the stack.
func (s *Stack) Push(value interface{}) {
	s.top = &Element{value, s.top}
	s.size++
}

// Pop picks out the last element from the stack.
func (s *Stack) Pop() (value interface{}) {
	if s.size > 0 {
		value, s.top = s.top.value, s.top.next
		s.size--
		return
	}
	return nil
}

// powerInt (use math.Pow() for float parameters)
func powerInt(n, p int) int {
	tmp := 1
	for i := 0; i < n; i++ {
		tmp *= p
	}
	return tmp
}

func findDivisors(n int, a *[]int) {
	if n == 1 {
		return
	}

	sqrt := int(math.Sqrt(float64(n)))
	for i := 2; i <= sqrt; i++ {
		if n%i == 0 {
			*a = append(*a, i)
			*a = append(*a, n/i)
		}
	}
	*a = append(*a, n)
}

func removeDuplicate(a []int) []int {
	m := make(map[int]bool)
	for i := 0; i < len(a); i++ {
		m[a[i]] = true
	}
	res := []int{}
	for i := range m {
		res = append(res, i)
	}
	return res
}

func abs(a int) int {
	if a > 0 {
		return a
	}
	return -a
}

// var gcdmap map[int](map[int]int)
// func gcd(a, b int) int {
// 	ina := a
// 	inb := b
// 	if _, ok := gcdmap[a]; !ok {
// 		gcdmap[a] = make(map[int]int)
// 	}
// 	if _, ok := gcdmap[ina][inb]; ok {
// 		return gcdmap[ina][inb]
// 	}
// 	for b != 0 {
// 		t := b
// 		b = a % b
// 		a = t
// 	}
// 	gcdmap[ina][inb] = a
// 	return a
// }

func gcd(a, b int) int {
	for a != 0 {
		a, b = b % a, a
	}
	return b
}

func power2mod(n, mod int) int {
	res, x := 1, 2
	for ; n > 0; n >>= 1 {
		if n&1 == 1 {
			res = res * x % mod
		}
		x = x * x % mod
	}
	return res
}

func power2(n int) int {
	return power2mod(n, magic)
}

// https://fishi.devtail.io/weblog/2015/06/25/computing-large-binomial-coefficients-modulo-prime-non-prime/

func modExp(b, e, mod int) int {
	r := 1
	for {
		// Logf("- %v %v\n", r, e)
		if e <= 0 {
			break
		}
		if (e & 1) == 1 {
			r = (r * b) % mod
		}
		b = (b * b) % mod
		e >>= 1
	}
	return r
}

func factExp(n, p int) int {
	e := 0
	u := p
	t := n
	for {
		if ! (u <= t) {
			break
		}
		e += t / u
		u *= p
	}
	return e
}

func getBaseDigits(n, b int) []int {
	d := []int{}
	for {
		if ! (n > 0) {
			break
		}
		d = append(d, n % b)
		n = n / b
	}
	return d
}

func fermatBinomAdvanced(n, k, p int) int {
	numDegree := factExp(n, p) - factExp(n - k, p)
	denDegree := factExp(k, p)
	if numDegree > denDegree {
		return 0
	}
	if k > n {
		return 0
	}

	num := 1
	for i := n; i > n - k; i-- {
		cur := i
		for {
			if ! (cur % p == 0) {
				break
			}
			cur /= p
		}
		num = (num * cur) % p
	}

	denom := 1
	for i := 1; i <= k; i++ {
		cur := i
		for {
			if ! (cur % p == 0) {
				break
			}
			cur /= p
		}
		denom = (denom * cur) % p
	}

	return (num * modExp(denom, p-2, p)) % p
}

func lucasBinom(n, k, p int) int {
	np := getBaseDigits(n, p)
	kp := getBaseDigits(k, p)

	binom := 1
	for i := len(np) - 1; i >= 0; i-- {
		ni := np[i]
		ki := 0
		if i < len(kp) {
			ki = kp[i]
		}
		binom = (binom * fermatBinomAdvanced(ni, ki, p)) % p
	}

	return binom
}

// * F[N]    => N! with modulo @magic
// * Finv[N] => 1/(N!) with modulo @magic
// * Inv[N]  => 1/N with modulo @magic
func prepareFactorial(n, magic int) (F, Finv, Inv []int) {
	F = make([]int, n + 1)
	Finv = make([]int, n + 1)
	Inv = make([]int, n + 1)
	F[0] = 1
	F[1] = 1
	Finv[0] = 1
	Finv[1] = 1
	Inv[0] = 1
	Inv[1] = 1
	for i := 2; i < n + 1; i++ {
		F[i] = F[i - 1] * i % magic
		Inv[i] = magic - Inv[magic % i] * (magic / i) % magic
		Finv[i] = Finv[i - 1] * Inv[i] % magic
	}
	return
}

// return (sumA)! / {(A[0])! * (A[1])! ... }
func preparedCombination(F, Finv *[]int, magic int, A ...int) int {
	sum := SumInt(A...)
	comb := (*F)[sum]
	for _, a := range A {
		comb *= (*Finv)[a]
		comb %= magic
	}
	return comb
}

func SumInt(A ...int) int {
	sum := 0
	for _, a := range A {
		sum += a
	}
	return sum
}


Measured memory_bytes: 2576