#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 2e5 + 7;
const int mod = 1e9 + 7;
bool cmp(const pair<long long, long long>& a,
         const pair<long long, long long>& b) {
  return a.first < b.first;
}
bool prime(int n) {
  if (n == 0 || n == 1) return 0;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
void solve() {
  long long k, f = 0, row;
  cin >> k;
  for (long long i = 5; i <= k; i++) {
    if (k % i == 0 and k / i >= 5) {
      f = 1;
      row = i;
      break;
    }
  }
  vector<char> v;
  v.push_back('a');
  v.push_back('e');
  v.push_back('i');
  v.push_back('o');
  v.push_back('u');
  if (f == 0) {
    cout << -1 << '\n';
  } else {
    long long column = k / row;
    long long j = 0;
    for (long long k = 0; k < row; k++) {
      j = j % 5;
      for (long long i = 0; i < column; i++) {
        cout << v[j % 5];
        j++;
      }
      j++;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
