#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-5;
char zimu[6] = {'2', 'a', 'e', 'i', 'o', 'u'};
char eg[10][10] = {"12345", "54231", "43512", "35124", "21453"};
bool isPrime(int num) {
  if (num == 1 || num == 0) return false;
  if (num == 2) return true;
  for (int i = 2; i <= sqrt(num); i++) {
    if (num % i == 0) return false;
  }
  return true;
}
int main() {
  int k;
  while (~scanf("%d", &k)) {
    int cnt = 0;
    int num = k;
    int n, m = 0;
    for (int i = 5; i <= num; i++) {
      while (num % i == 0) {
        if (m == 0) m = num / i;
        num /= i;
        cnt++;
      }
      if (cnt >= 2) break;
    }
    if (cnt < 2) {
      puts("-1");
      continue;
    }
    n = k / m;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (i < 5 && j < 5) {
          printf("%c", zimu[eg[i][j] - '0']);
        } else {
          printf("%c", zimu[eg[i % 5][j % 5] - '0']);
        }
      }
    }
    puts("");
  }
}
