#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 2000005;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    srand((unsigned)time(NULL));
    ll D,C = 26;
    cin >> D;
    vector<ll> c(C);
    vector<vector<ll>> s(D,vector<ll>(C));
    cins(all(c));
    rep(i,D){
        rep(j,C){
            cin >> s[i][j];
        }
    }
    vector<ll> t(D,-1);
    rep(i,D){
        ll k = -1,ind = -1;
        rep(j,C){
            if (chmax(k,s[i][j])) ind = j;
        }
        t[i] = ind;
    }
    vector<vector<ll>> last(D,vector<ll>(C,-1));
    rep(_,MAX){
        ll day = rand()%D,nc = rand()%C;
        if (t[day] == nc) nc = (nc+1)%C;
        ll dis = 0;
        dis += s[day][nc];
        dis -= s[day][t[day]];
        rep(j,D){
            if (j >= day && last[j][t[day]] == day){
                if (day == 0){
                    dis -= c[t[day]];
                }
                else{
                    dis -= c[t[day]]*(day-last[day-1][t[day]]);
                }
            }
            if (j >= day && last[j][nc] < day){
                dis += c[nc]*(day-last[j][nc]);
            }
        }
        if (dis > 0){
            rep(j,D){
                if (j >= day && last[j][t[day]] == day){
                    if (day == 0){
                        last[j][t[day]] = -1;
                    }
                    else{
                        last[j][t[day]] = last[day-1][t[day]];
                    }
                }
                if (j >= day && last[j][nc] < day){
                    last[j][nc] = day;
                }
            }
            t[day] = nc;
        }
    }
    rep(i,D) PRINT(t[i]+1);
}


Measured memory_bytes: 3844