#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! loop_timeout {
    ( $sec:expr; $body:expr ) => {
        let now = std::time::SystemTime::now();
        loop {
            match now.elapsed() {
                Ok(elapsed) => {
                    if elapsed.as_millis() > $sec {
                        break;
                    }
                    $body
                }
                Err(e) => {
                    eprintln!("Err, {:?}", e);
                }
            }
        }
    };
}

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

fn score(cs: &Vec<i64>, s: &Vec<Vec<i64>>, t: &[usize]) -> i64 {
    let days = t.len();
    let mut r = 0;
    let mut last = vec![0; 26];
    for d in 0..days {
        let i = t[d];
        last[i] = d + 1;
        r += s[d][i];
        for i in 0..26 {
            r -= cs[i] * (d + 1 - last[i]) as i64;
        }
    }
    r
}

fn random_gene(d: usize, rng: &mut XorShift) -> Vec<usize> {
    (0..d).map(|_| rng.gen::<usize>() % 26).collect()
}

fn cross(g: &Vec<usize>, h: &Vec<usize>, rng: &mut XorShift) -> Vec<usize> {
    let d = g.len();
    let i = rng.gen::<usize>() % (d - 1) + 1;
    let mut child: Vec<usize> = g[0..i].iter().chain(h[i..].iter()).cloned().collect();
    child[i] = rng.gen::<usize>() % 26;
    child
}

fn argmax(xs: &Vec<i64>) -> usize {
    let n = xs.len();
    let mut is: Vec<_> = (0..n).map(|i| (xs[i], i)).collect();
    is.sort();
    is[n - 1].1
}

fn main() {
    let mut sc = Scanner::new();
    let mut rng = XorShift::new();

    use std::cmp::Reverse;

    let d: usize = sc.cin();
    let cs: Vec<i64> = sc.vec(26);
    let s: Vec<Vec<i64>> = (0..d).map(|_| sc.vec(26)).collect();

    let mut pool: Vec<_> = vec![];
    let np = 180;

    for _ in 0..np {
        let g = random_gene(d, &mut rng);
        pool.push((Reverse(score(&cs, &s, &g)), g));
    }

    let mut count = 0;
    loop_timeout!(1970; {
        count += 1;
        let i = rng.gen::<usize>() % np;
        let j = (i +  rng.gen::<usize>() % (np-1)) % np;
        let g = &pool[i].1;
        let h = &pool[j].1;
        let child = cross(&g, &h, &mut rng);
        pool.push((Reverse( score(&cs, &s, &child)), child));

        if pool.len() > np * 4 {
            pool.sort();
            while pool.len() > np {
                let _ = pool.pop();
            }
            // {
            //     let g = random_gene(d, &mut rng);
            //     pool.push((Reverse(score(&cs, &s, &g)), g));
            // }
        }
    });

    eprintln!("Loop count {}", count);
    pool.sort();
    let ans = &pool[0].1;
    trace!(pool[0]);
    for &i in ans.iter() {
        put!(i + 1);
    }
}

pub trait FromU64 {
    fn coerce(x: u64) -> Self;
}
impl FromU64 for u64 {
    fn coerce(x: u64) -> Self {
        x
    }
}
impl FromU64 for i64 {
    fn coerce(x: u64) -> Self {
        x as i64
    }
}
impl FromU64 for u32 {
    fn coerce(x: u64) -> Self {
        x as u32
    }
}
impl FromU64 for i32 {
    fn coerce(x: u64) -> Self {
        x as i32
    }
}
impl FromU64 for usize {
    fn coerce(x: u64) -> Self {
        x as usize
    }
}
impl FromU64 for bool {
    fn coerce(x: u64) -> Self {
        x % 2 == 0
    }
}

// returns [0, 1]
impl FromU64 for f64 {
    fn coerce(x: u64) -> Self {
        (x as f64) / (std::u64::MAX as f64)
    }
}
impl FromU64 for f32 {
    fn coerce(x: u64) -> Self {
        (x as f32) / (std::u64::MAX as f32)
    }
}

struct XorShift(u64);
impl XorShift {
    fn new() -> Self {
        XorShift(88172645463325252)
    }
    fn next(&mut self) -> u64 {
        let mut x = self.0;
        x = x ^ (x << 13);
        x = x ^ (x >> 7);
        x = x ^ (x << 17);
        self.0 = x;
        x
    }
    fn gen<T: FromU64>(&mut self) -> T {
        FromU64::coerce(self.next())
    }
}

use std::collections::VecDeque;
use std::io::{self, Write};
use std::str::FromStr;

struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    fn new() -> Self {
        Scanner {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}


Measured memory_bytes: 4392