#include <bits/stdc++.h>
using namespace std;
#define kien long long
#define int int64_t
#define pb push_back
#define FOR(i, a, b) for (int i = a;i <= b; i++)
#define FORD(i, a, b) for (int i = a;i >= b; i--)
#define pii pair<int, int>
#define dembit(a) __builtin_popcountll(a)
#define task "kien"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define debug(x) cout << x << " "
#define down cout << "\n"
const kien MOD = 1e18 + 7;
const int NTEST = 100;
const int Million = 1e6;
const int MXN = 7e4 + 5;
const int INF = 1e9;
mt19937 rd(chrono::high_resolution_clock::now().time_since_epoch().count());
kien rand(kien l, kien r) {
assert(l <= r);
return uniform_int_distribution<kien>(l, r)(rd);
}
kien n, k, m, u, v, h, nxt[MXN][200], dp[MXN];
kien maxx, minn, sum, vtr, s, t, r, x, l, timer, ans, add;
vector <int> vec;
//pii a[MXN];
void solve() {
cin >> n;
string s; cin >> s;
FOR (i, 'a', 'z') nxt[n][i] = -1;
FORD (i, s.size() - 1, 0) {
FOR (j, 'a', 'z') nxt[i][j] = nxt[i + 1][j];
nxt[i][s[i]] = i;
}
FOR (i, 0, n - 1) {
if (s[i] == 'e') vec.pb(i);
dp[i] = INF;
}
if (vec.empty()) {cout << 0; return;}
int cur = 0;
dp[0] = 0;
FOR (i, 0, n - 1) {
cout << vec[cur] << " ";
if (i < vec[cur]) {
FOR (j, 'a', 'z') {
if (nxt[i][j] == -1 or j == 'e' or j == s[i]) continue;
if (nxt[i][j] > vec[cur]) dp[vec[cur]] = min(dp[vec[cur]], dp[i] + 1 + nxt[i][j] - vec[cur]);
else dp[nxt[i][j]] = min(dp[nxt[i][j]], dp[i] + 1);
}
}
else if (i == vec[cur]) {
dp[i + 1] = dp[i] + 1;
++cur;
}
if (cur == vec.size()) {
cout << dp[i] << "\n";
break;
}
}
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (fopen(task".inp", "r")) {
fin(task); fou(task);
}
int tt = 1; // cin >> tt;
while(tt--) {
solve();
}
cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << "s ";
}
