Problem: 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.

Solution (in JAVA):

Solution:

import java.io.IOException;
import java.io.InputStream;
import java.util.*;

public class Main {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long readLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

    static int prime[];
    static void sieveOfEratosthenes(int n)
    {
        prime = new int[n+1];
        for(int i=0;i<n;i++)
            prime[i] = 0;

        for(int p = 2; p*p <=n; p++)
        {
            if(prime[p] == 0)
            {
                for(int i = p*p; i <= n; i += p) {
                    if(prime[i] == 0) {
                        prime[i] = p;
                    }
                }
            }
        }
    }
    public static void main(String[] args) {
        InputReader in  = new InputReader(System.in);
        sieveOfEratosthenes(10000);
        int n = in.readInt();

        int x = prime[n];

        if(x == 0 || n < 25 || n == 32 || n == 27) {
            System.out.println(-1);
        }
        else {
            boolean f1 = false;
            int y = n / prime[n];
            if(x >= 5 && y >= 5) {

            }
            else {
                if (x < 5 && y < 5) {
                    f1 = true;
                } else if (x < 5 && prime[y] == 0) {
                    f1 = true;
                } else {
                    if (x == 2 && prime[y] == 2) {
                        int z = y / prime[y];
                        if (prime[z] == 0) {
                            f1 = true;
                        } else {
                            if (prime[z] == 2) {
                                x = 8;
                                y = n / 8;
                            } else {
                                x = x * prime[z];
                                y = y / prime[z];
                            }
                        }
                    } else {
                        x = x * prime[y];
                        y = y / prime[y];
                    }
                }
            }

            if(f1) {
                System.out.println(-1);
            }
            else {
                String st1 = "aeiou";
                String st2 = "eioua";
                String st3 = "ouaei";
                String st4 = "uaeio";
                String st5 = "iouae";

                String resst1 = "";
                String resst2 = "";
                String resst3 = "";
                String resst4 = "";
                String resst5 = "";

                while(x != 0) {
                    if((x-5) >= 0) {
                        x = x - 5;
                        resst1 += st1;
                        resst2 += st2;
                        resst3 += st3;
                        resst4 += st4;
                        resst5 += st5;
                    }
                    else {
                        resst1 += st1.substring(0,x);
                        resst2 += st2.substring(0,x);
                        resst3 += st3.substring(0,x);
                        resst4 += st4.substring(0,x);
                        resst5 += st5.substring(0,x);
                        x = 0;
                    }
                }

                String res = "";

                while(y != 0) {
                    if((y-5) >= 0) {
                        y = y - 5;
                        res += resst1 + resst2 + resst3 + resst4 + resst5;
                    }
                    else {
                        if(y == 1) {
                            res += resst1;

                        }
                        else if(y == 2) {
                            res += resst1 + resst2;

                        }
                        else if(y == 3) {
                            res += resst1 + resst2 + resst3;

                        }
                        else if(y == 4) {
                            res += resst1 + resst2 + resst3 + resst4;
                        }
                        y = 0;
                    }


                }
                System.out.println(res);
            }
        }

    }


    static int lowerBound(long a[],int n,long x) {
        int lo = 0;
        int hi = n;

        while(lo < hi) {
           int mid = (lo + hi)/2;
           if(a[mid] >= x) {
               hi = mid;
           }
           else {
               lo = mid + 1;
           }
        }

        return lo;
    }


}