#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
void setmin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void setmax(T& a, T val) {
  if (a < val) a = val;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
using namespace std;
int main() {
  int hs[26] = {0};
  int n;
  cin >> n;
  string s;
  cin >> s;
  for (int i = 0; i < n; i++) hs[s[i] - 'a']++;
  int cnt1 = min(hs['o' - 'a'], min(hs['n' - 'a'], hs['e' - 'a'])),
      cnt = 5000000;
  hs['o' - 'a'] -= cnt1;
  hs['n' - 'a'] -= cnt1;
  hs['e' - 'a'] -= cnt1;
  cnt = min(hs['z' - 'a'], hs['e' - 'a']);
  cnt = min(cnt, min(hs['r' - 'a'], hs['o' - 'a']));
  string ans;
  for (int i = 0; i < cnt1; i++) {
    cout << 1 << " ";
  }
  for (int i = 0; i < cnt; i++) {
    cout << 0 << " ";
  }
  cout << "\n";
  return 0;
}
