#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long x) {
  for (long long i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t, n, m, a = 0, b = 0, d, c, x = 0, y = 0, ans = 0, sum = 0, i, j,
                     k;
  string s;
  cin >> s;
  n = s.size() - 1;
  if (s[n] != 'a' and s[n] != 'e' and s[n] != 'i' and s[n] != 'o' and
      s[n] != 'u' and s[n] != 'n') {
    cout << "NO";
    return 0;
  }
  for (i = 0; i < s.size(); i++) {
    if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or
        s[i] == 'u' or s[i] == 'n') {
      if (s[i] == 'n' and y == 1) {
        cout << "NO";
        return 0;
      }
      y = 0;
    } else {
      y++;
    }
    if (y == 2) {
      {
        cout << "NO";
        return 0;
      }
    }
  }
  cout << "YES";
  return 0;
}
