#include <bits/stdc++.h>
using namespace std;
const long long mod = (int)1e9 + 7;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1};
const int MAX = (int)1e5 + 10;
using namespace std;
void Ka8eeM() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
}
map<char, bool> cnt;
int main() {
  Ka8eeM();
  string s;
  cin >> s;
  cnt['a'] = cnt['e'] = cnt['u'] = cnt['i'] = cnt['o'] = 1;
  reverse(((s).begin()), ((s).end()));
  if (s.front() != 'n' && !cnt[s.front()])
    cout << "NO\n";
  else {
    reverse(((s).begin()), ((s).end()));
    for (int i = 0; i < (int)s.size() - 1; i++) {
      if (s[i] == 'n') continue;
      if (!cnt[s[i]] && !cnt[s[i + 1]]) {
        cout << "NO\n";
        return 0;
      }
    }
    cout << "YES\n";
  }
  return 0;
}
