#include <bits/stdc++.h>
using namespace std;
long long int pow1(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long int pmod(long long int x, long long int y, long long int modi) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = ((res % modi) * (x % modi)) % modi;
    y = y >> 1;
    x = ((x % modi) * (x % modi)) % modi;
  }
  return res % modi;
}
void dfs(vector<long long int> adj[], bool vis[], long long int i) {
  vis[i] = true;
  cout << i + 1 << " ";
  for (int j = 0; j < adj[i].size(); j++)
    if (!vis[adj[i][j]]) dfs(adj, vis, adj[i][j]);
}
bool comp(pair<long long int, long long int> &a,
          pair<long long int, long long int> &b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first > b.first;
}
bool comp1(pair<pair<long long int, long long int>, long long int> &a,
           pair<pair<long long int, long long int>, long long int> &b) {
  if (a.first.first == b.first.first) return a.first.second < b.first.second;
  return a.first.first > b.first.first;
}
long double area(long double r, long double pi) { return pi * r * r; }
long long int bs(long long int a[], long long int l, long long int r,
                 long long int x) {
  long long int mid = (l + r) / 2;
  if (r >= l) {
    if (a[mid] == x) return mid;
    if (a[mid] > x) return bs(a, l, mid - 1, x);
    if (a[mid] < x) return bs(a, mid + 1, r, x);
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  string s;
  cin >> s;
  long long int n = s.length();
  if (s[n - 1] != 'a' && s[n - 1] != 'e' && s[n - 1] != 'o' &&
      s[n - 1] != 'i' && s[n - 1] != 'u' && s[n - 1] != 'n') {
    cout << "NO";
    return 0;
  }
  for (int i = 0; i < s.length() - 1; i++) {
    if (s[i] == 'n') continue;
    if (!(s[i] == 'a' || s[i] == 'e' || s[i] == 'o' || s[i] == 'u' ||
          s[i] == 'i')) {
      if ((s[i + 1] == 'a' || s[i + 1] == 'e' || s[i + 1] == 'o' ||
           s[i + 1] == 'u' || s[i + 1] == 'i'))
        continue;
      else {
        cout << "NO";
        return 0;
      }
    }
  }
  cout << "YES";
}
