#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
  _out << _p.first << ' ' << _p.second;
  return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
  _in >> _p.first >> _p.second;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
  if (_v.empty()) {
    return _out;
  }
  _out << _v.front();
  for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) {
    _in >> _i;
  }
  return _in;
}
const long long MAXN = 3e5;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
class AKartochki {
 public:
  void solve(std::istream &in, std::ostream &out) {
    long long n;
    in >> n;
    string s;
    in >> s;
    map<char, long long> kek;
    for (auto v : s) {
      kek[v]++;
    }
    for (long long i = 0; i < kek['n']; i++) {
      out << "1 ";
    }
    for (long long i = 0; i < kek['z']; i++) {
      out << "0 ";
    }
  }
};
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  AKartochki solver;
  std::istream &in(std::cin);
  std::ostream &out(std::cout);
  solver.solve(in, out);
  return 0;
}
