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

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
    return '"' + s + '"';
}

string to_string(const char* s) {
    return to_string((string) s);
}

string to_string(bool b) {
     return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}

template <size_t N>
string to_string(bitset<N> v) {
    string res = "";
    for (size_t i = 0; i < N; i++) {
        res += static_cast<char>('0' + v[i]);
    }
    return res;
}

template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
            first = false;
            res += to_string(x);
    }
    res += "}";
    return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
void chmax(string &a, string b) {
    if (a == "-") a = b;
    else if (a.size() < b.size()) a = b;
    else if (a.size() == b.size()) {
        if (a < b) a = b;
    }
}
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const long long INFLL = (1LL << 62) - 1;
const int INFI = (1 << 30) - 1;
template<typename T> void printv(vector<T>&v) {
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << " ";
    cout << v.back() << endl;
}
static const long double pi = acos(-1.0);
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };

int D;
vector<int> C(26);
vector<vector<int>> S;
vector<int> V;

int getScore() {
    vector<vector<int>> lastDs(26, vector<int>(1, -1));
    int score = 0;
    rep(d, D) {
        int v = V[d];
        score += S[d][v];
        lastDs[v].push_back(d);
        rep(c, 26) {
            score -= (d - lastDs[c].back()) * C[c];
        }
    }

    return score;
}

int recalculate(int date, int newC, int beforeC, int score) {

}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> D;
    rep(i, 26) cin >> C[i];

    V.resize(D);
    S.resize(D);

    vector<int> lastD(26, -1);

    rep(i, D) {
        S[i].resize(26);
        int maxC = 0;
        rep(c, 26) {
            cin >> S[i][c];
            int thisScore = S[i][c] + (C[c] * (i - lastD[c]));
            int curMaxScore = S[i][maxC] + (C[maxC] * (i - lastD[maxC]));

            if(i > 0 && thisScore > curMaxScore) {
                maxC = c;
            }

            V[i] = maxC;
            lastD[maxC] = i;
        }
    }

    int score = getScore();
    srand((unsigned int)time(NULL));

    rep(i, 200) {
        int newC = rand() % 26;
        int date = rand() % D;
        int beforeC = V[date];
        if(newC == beforeC) continue;
        V[date] = newC;
        int newScore = getScore();
        if(newScore > score) {
            score = newScore;
        } else {
            V[date] = beforeC;
        }
    }

    for(auto&a:V) {
        print(a + 1);
    }
}


Measured memory_bytes: 3692