#include <bits/stdc++.h>
using namespace std;
string s;
map<char, int> m;
int main() {
  m['a'] = 1;
  m['e'] = 1;
  m['i'] = 1;
  m['o'] = 1;
  m['u'] = 1;
  cin >> s;
  bool flag = true;
  for (int i = 0; i < (int)s.length(); i++) {
    if (s[i] == 'n') continue;
    if (m.find(s[i]) == m.end()) {
      if ((i + 1) == (int)s.length() || m.find(s[i + 1]) == m.end()) {
        flag = false;
        break;
      }
    }
  }
  if (flag)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
