#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
char s[M];
map<char, int> mp;
int main() {
  int n;
  scanf("%d", &n);
  scanf("%s", s);
  for (int i = 0; i < n; i++) {
    mp[s[i]]++;
  }
  int minn1 = M;
  if (mp['o'] && mp['n'] && mp['e']) {
    minn1 = min(minn1, mp['o']);
    minn1 = min(minn1, mp['n']);
    minn1 = min(minn1, mp['e']);
    mp['o'] -= minn1;
    mp['e'] -= minn1;
  }
  int minn2 = M;
  if (mp['z'] && mp['e'] && mp['r'] && mp['o']) {
    minn2 = min(minn2, mp['z']);
    minn2 = min(minn2, mp['e']);
    minn2 = min(minn2, mp['r']);
    minn2 = min(minn2, mp['o']);
  }
  if (minn1 == M) minn1 = 0;
  if (minn2 == M) minn2 = 0;
  for (int i = 1; i <= minn1; i++) printf("1 ");
  for (int i = 1; i <= minn2; i++) printf("0 ");
  return 0;
}
