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

#define ll long long

const int MAXN = 2e6 + 5;
double log_fact[MAXN];
int a[MAXN];
int cost[MAXN];

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

    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];

    // Tiền xử lý log(factorial)
    log_fact[0] = 0;
    for (int i = 1; i <= n; ++i)
        log_fact[i] = log_fact[i - 1] + log(a[i]);

    vector<int> res(n + 1);
    int l = 1;
    double max_score = -1e18;

    for (int k = 1; k <= n; ++k) {
        double sum_log = 0;
        max_score = -1e18;
        int max_len = 1;

        for (int i = k, j = k; i >= 1; --i) {
            sum_log += log(a[i]);
            int len = j - i + 1;
            double score = sum_log - log_fact[len];

            if (score > max_score) {
                max_score = score;
                max_len = len;
            }
        }
        cout << max_len << ' ';
    }

    return 0;
}