#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

#include <random>
mt19937 rng( 711 );

LL score( const VI &C, const VVI &S, const VI &schedule )
{
	const int D = SZ( S );

	LL res = 0;
	VI last( 26, -1 );

	REP( i, D )
	{
		res += S[i][ schedule[i] ];

		last[ schedule[i] ] = i;

		REP( j, 26 )
		{
			res -= C[j] * ( i - last[j] );
		}
	}

	return move( res );
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, D );
	VI C( 26 );
	cin >> C;
	VVI S( D, VI( 26 ) );
	cin >> S;

	const clock_t clock_start = clock();
	constexpr double TIME_LIMIT = 1.95;

	uniform_int_distribution< int > rng_d( 0, D - 1 );
	uniform_int_distribution< int > rng_26( 0, 25 );
	uniform_real_distribution< double > rng_p( 0, 1 );

	VI current( D );
	generate( ALL( current ), [&]{ return rng_26( rng ); } );
	VI best( current );

	LL current_score = score( C, S, current ), best_score = current_score;

	for ( clock_t clock_now; 1. * ( ( clock_now = clock() ) - clock_start ) / CLOCKS_PER_SEC < TIME_LIMIT; ) REP( 32 )
	{
		const double T = TIME_LIMIT;
		const double t = T - 1. * ( clock_now - clock_start ) / CLOCKS_PER_SEC;
		const double temp_start = 365 * 26 * 100;
		const double temp_end = 1;
		const double temp = ( temp_start - temp_end ) * ( t / T );

		const int d = rng_d( rng );
		const int c = rng_26( rng );

		const int c_ = current[d];

		current[d] = c;

		const int next_score = score( C, S, current );
		const double p = min( 1.0, exp( ( next_score - current_score ) / temp ) );

		if ( best_score < next_score )
		{
			best_score = next_score;
			best = current;
		}

// 		if ( current_score < next_score || rng_p( rng ) < p )
		if ( current_score < next_score )
		{
			current_score = next_score;
		}
		else
		{
			current[d] = c_;
		}
	}

	DUMP( best_score );
	transform( ALL( best ), OSI< int >( cout, "\n" ), bind( plus< int >(), _1, 1 ) );
	cout << flush;

	return 0;
}

Measured memory_bytes: 3756