#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using pii = pair<int, int>;
const int MOD = 1e9 + 7, N = 2e3 + 10;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long k;
  cin >> k;
  long long n = 0, m = 0;
  for (long long i = 5; i * i <= k; i++) {
    if (k % i == 0 && k / i > 4) {
      n = i;
      m = k / i;
    }
  }
  if (n == 0 || m == 0)
    cout << -1;
  else {
    string s = "aeiou";
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < m; j++) {
        cout << s[(i + j) % 5];
      }
    }
  }
  return 0;
}
