#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
long long arr[maxn];
long long quickpow(long long q, long long n, long long mod) {
  long long ans = 1;
  while (n) {
    if (n & 1) {
      ans = (ans % mod) * (q % mod) % mod;
    }
    n >>= 1;
    q = (q % mod) * (q % mod) % mod;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  long long n, i, j, k, l, m, x, y;
  string str;
  cin >> str;
  for (i = 0; i < str.length(); i++) {
    if (i == n - 1 && str[i] != 'a' && str[i] != 'e' && str[i] != 'o' &&
        str[i] != 'u' && str[i] != 'i' && str[i] != 'n') {
      cout << "NO" << endl;
      return 0;
    }
    if (str[i] != 'a' && str[i] != 'e' && str[i] != 'o' && str[i] != 'u' &&
        str[i] != 'i' && str[i] != 'n') {
      if (str[i + 1] != 'a' && str[i + 1] != 'e' && str[i + 1] != 'o' &&
          str[i + 1] != 'u' && str[i + 1] != 'i') {
        cout << "NO" << endl;
        return 0;
      }
    }
  }
  cout << "YES" << endl;
  return 0;
}
