Tom loves vowels, and he likes long words with many vowels. His favorite words are vowelly words. We say a word of length k is vowelly if there are positive integers n and m such that n⋅ m = k and when the word is written by using n rows and m columns (the first row is filled first, then the second and so on, with each row filled from left to right), every vowel of the English alphabet appears at least once in every row and every column.

You are given an integer k and you must either print a vowelly word of length k or print -1 if no such word exists.

In this problem the vowels of the English alphabet are 'a', 'e', 'i', 'o' ,'u'.

Input

Input consists of a single line containing the integer k (1≤ k ≤ 10^4) — the required length.

Output

The output must consist of a single line, consisting of a vowelly word of length k consisting of lowercase English letters if it exists or -1 if it does not.

If there are multiple possible words, you may output any of them.

Examples

Input


7


Output


-1


Input


36


Output


agoeuioaeiruuimaeoieauoweouoiaouimae

Note

In the second example, the word "agoeuioaeiruuimaeoieauoweouoiaouimae" can be arranged into the following 6 × 6 grid:

<image>

It is easy to verify that every row and every column contain all the vowels.
import java.io.BufferedInputStream;
import java.util.Scanner;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.io.BufferedInputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.HashMap;
import java.util.Scanner;
public class Codeforces {
	static int count =0;
	static 	PrintWriter pw=new PrintWriter(System.out);
	public static void main(String [] args) throws IOException {
		Scanner sc=new Scanner(System.in);
		TreeSet<Integer> treeSet=new TreeSet<Integer>();
		int x=sc.nextInt();
		int n=5,m=0;
		for(;n<=x/5;n++) {
			if(x%n==0) {
				m=x/n;
				break;
			}
		}
		if(m==0)
			pw.println(-1);
		else {
			StringBuilder sb=new StringBuilder();
		//	pw.println(n+" "+m);
			char [] arr= { 'a', 'e', 'i', 'o' ,'u'};
			for(int i=0,j=0;i<n ;i++) {
				if(j==5) j=0;
				sb.append(arr[j]);
				for(int k=j+1,k1=1;k1<m;k1++) {
					if(k==5) k=0;
					sb.append(arr[k]);
					k++;
				}
					j++;
			}
			pw.println(sb);
		}
		pw.flush();
		pw.close();
	}
	static class pair implements Comparable<pair>{
		String  name; int x,y ;
		String x1;
		public pair(String name , int x) {
			this.name=name; this.x=x;
		}
		public pair(String x1) {
			this.x1=x1;
		}
		public int compareTo(pair o) {
			if(x1.length()!=o.x1.length()) return x1.length()-o.x1.length();
			return x1.compareTo(o.x1);
		}
//		public int compareTo(pair o) {
//			if(!name.equals(o.name))
//				return name.compareTo(o.name);
//			return x-o.x;
//		}
//		public String toString() {
//			return name +" "+x;
//		}
		public String toString() {
			return x1;
		}
	}
   static class Scanner {
		StringTokenizer st;
		BufferedReader br;
 
		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public Scanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
	}