//include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
using LL = int64_t;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using PLL = pair<LL, LL>;

//container util
//------------------------------------------
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)
#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define ALL(x) ::std::begin(x), ::std::end(x)
#define RALL(x) ::std::rbegin(x), ::std::rend(x)
#define SORT(c) whole(sort, c)
#define RSORT(c) rwhole(sort, c)

//constant
//--------------------------------------------
constexpr double EPS = 1e-10;
constexpr double PI  = 3.14159265358979323846;
constexpr int MOD = 1000000007;

// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};

//debug
//--------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

//IO accelerate
//--------------------------------------------
struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

//template
//--------------------------------------------
// declaretion
template<typename T> istream& operator >>(istream& is, vector<T>& vec);
template<typename T1, typename T2> ostream& operator <<(ostream& os, const pair<T1, T2>& p);
template<typename T> ostream& operator <<(ostream& os, const vector<T>& vec);
template<typename T> ostream& operator <<(ostream& os, const vector<vector<T>>& vv);
template<typename T> vector<T> make_v(size_t a);
template<typename T,typename... Ts> auto make_v(size_t a,Ts... ts);
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v);
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v);

// implementation
template<typename T>
istream& operator >>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}
template<typename T1, typename T2>
ostream& operator <<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << "," << p.second;
	return os;
}
template<typename T>
ostream& operator <<(ostream& os, const vector<T>& vec) {
	for(int i=0; i<vec.size(); i++){
		os << vec[i] << ( i+1 == vec.size() ? "" : "\t" );
	}
	return os;
}
template<typename T>
ostream& operator <<(ostream& s, const vector<vector<T>>& vv) {
	for (int i = 0; i < vv.size(); ++i) {
		s << vv[i] << endl;
	}
	return s;
}

// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
	for(auto &e:t) fill_v(e,v);
}

template<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}
template<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}
template<typename T> T gcd(T a, T b) { return b?gcd(b,a%b):a;}
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b;}

//main code

int main(int argc, char *argv[])
{
	LL d;
	cin >> d;
	VL c(26);
	cin >> c;
	VVL s(d,VL(26));
	cin >> s;
	VL rem(26,0);
	LL score = 0;
	for (int i = 1; i <= 363; i += 3) {
		LL mx = INT64_MIN;
			LL mns = 0;
		VL t(3,0);
		//for (int j = 0; j < 26; j++) {
		//	mns += (i-rem[j]+0)*c[j];
		//	mns += (i-rem[j]+1)*c[j];
		//	mns += (i-rem[j]+2)*c[j];
		//}
		LL mmns;
		LL ppls;
		for (int j = 0; j < 26; j++) { //i日目
		for (int k = 0; k < 26; k++) { //i+1日目
		for (int l = 0; l < 26; l++) { //i+2日目
			LL t_mns = 0;
			VVL rem3(3, rem);
			rem3[0][j] = i;
			rem3[1][k] = i+1;
			rem3[2][l] = i+2;
			for (int a = 0; a < 3; a++) {
				for (int b = 0; b < 26; b++) {
					t_mns += (i-rem3[a][b]+a)*c[b];
				}
			}
			//if (j == k and k == l) {
			//	t_mns = mns - (i-rem[j])*c[j] - (i+1-rem[k])*c[k] + (i+2-rem[l])*c[l];
			//}
			//t_mns = mns - (i-rem[j])*c[j] - (i+1-rem[k])*c[k] + (i+2-rem[l])*c[l];
			LL t_pls = s[i-1][j] + s[i][k] + s[i+1][l];
			if (mx < t_pls - t_mns) {
				mx = t_pls - t_mns;
				t = {j,k,l};
				mmns = t_mns;
				ppls = t_pls;
			}
		}
		}
		}
		score += ppls - mmns;
		dump(score);
		dump(mmns);
		dump(rem);
		rem[t[0]] = i;
		rem[t[1]] = i+1;
		rem[t[2]] = i+2;
		for (int j = 0; j < 3; j++) {
			cout << t[j]+1 << '\n';
		}
	}
	LL mns = 0;
	LL mx = INT64_MIN;
	VL t(2,0);
	for (int j = 0; j < 26; j++) {
		mns += (365-rem[j])*c[j];
	}
	LL mmns;
	LL ppls;
	for (int j = 0; j < 26; j++) { //364日目
	for (int k = 0; k < 26; k++) { //365日目
		LL t_mns = mns - (364-rem[j])*c[j] - (365-rem[k])*c[k];
		LL t_pls = s[363][j] + s[364][k];
		if (mx < t_pls - t_mns) {
			mx = t_pls - t_mns;
			t = {j,k};
			mmns = t_mns;
			ppls = t_pls;
		}
	}
	}
	score += ppls - mmns;
	dump(score);
	for (int i = 0; i < 2; i++) {
		cout << t[i]+1 << '\n';
	}
	return 0;
}

Measured memory_bytes: 3740