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.*;
import java.util.*;
import java.lang.*;
import java.math.*;
public final  class Main extends Thread  {
    boolean[] prime;
    FastScanner sc;
    PrintWriter pw;
    MathF mf;
    long startTime = System.currentTimeMillis();
    final class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            try {
                br = new BufferedReader(new InputStreamReader(System.in));
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        public long nlo() {
            return Long.parseLong(next());
        }

        public String next() {
            if (st.hasMoreTokens()) return st.nextToken();
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
            return st.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public String nli() {
            String line = "";
            if (st.hasMoreTokens()) line = st.nextToken();
            else try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            while (st.hasMoreTokens()) line += " " + st.nextToken();
            return line;
        }

        public double nd() {
            return Double.parseDouble(next());
        }
    }
    final class MathF {
        public  long gcd(long a, long b) {
            return (b == 0 ? a : gcd(b, a % b));
        }

        public  int nod(long x) {
            int i = 0;
            while (x != 0) {
                i++;
                x = x / 10;
            }
            return i;
        }

        public  int nob(long x) {
            if(x==0)
                return 1;
            return (int) Math.floor(Math.log(x) / Math.log(2)) + 1;
        }

        public int[] FastradixSort(int[] f) {
            int[] to = new int[f.length];
            {
                int[] b = new int[65537];
                for (int i = 0; i < f.length; i++) b[1 + (f[i] & 0xffff)]++;
                for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];
                for (int i = 0; i < f.length; i++) to[b[f[i] & 0xffff]++] = f[i];
                int[] d = f;
                f = to;
                to = d;
            }
            {
                int[] b = new int[65537];
                for (int i = 0; i < f.length; i++) b[1 + (f[i] >>> 16)]++;
                for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];
                for (int i = 0; i < f.length; i++) to[b[f[i] >>> 16]++] = f[i];
                int[] d = f;
                f = to;
                to = d;
            }
            return f;
        }

        public  void Primesieve(int n) {
            for (int i = 0; i < n; i++)
                prime[i] = true;
            for (int p = 2; p * p < n; p++) {
                if (prime[p] == true) {
                    for (int i = p * p; i < n; i += p)
                        prime[i] = false;
                }
            }
        }
    };
    public Main(ThreadGroup t,Runnable r,String s,long d )
    {
        super(t,r,s,d);
    }
    public void run()
    {
        sc=new FastScanner();
        pw=new PrintWriter(System.out);
        mf=new MathF();
        solve();
        pw.flush();
        pw.close();
        System.err.println("\n[Time : " + (System.currentTimeMillis() - startTime) + " ms]");
    }
    public static void main(String[] args)
    {
        new Main(null,null,"",1<<20).start();
    }


    /////////////------------------------------------//////////////
    ////////////------------------Main-Logic--------//////////////
    ///////////-------------------------------------//////////////



    public void solve()
    {
        int t;
        t=1;
        while(t>0)
        {
            int n=sc.ni(),i,k,j,l;
            if(n<25)
            {
                pw.println("-1");
                return;
            }
            i=n-1;
            while(i>=5)
            {
                if(n%i==0)
                {
                    if((n/i)>=5)
                        break;
                }
                i--;
            }
            //pw.println(i);
            if((n%i)!=0||((n/i)<5)||i<5)
            {
                pw.println(-1);
                break;
            }
            else{
                char[][] wrr=new char[i][n/i];
                char[] arr=new char[5];
                arr[0]='a';
                arr[1]='e';
                arr[2]='i';
                arr[3]='o';
                arr[4]='u';
                int a=i;
                int b=n/i;
                for(i=0;i<b;i++)
                    wrr[0][i]=arr[i%5];
                for(i=1;i<a;i++)
                {
                    if(wrr[i-1][0]=='a')
                        k=1;
                    else if(wrr[i-1][0]=='e')
                        k=2;
                    else if(wrr[i-1][0]=='i')
                        k=3;
                    else if(wrr[i-1][0]=='o')
                        k=4;
                    else
                        k=0;

                    for(j=0;j<b;j++)
                    {
                        wrr[i][j]=arr[k];
                        k=(k+1)%5;
                    }
                }
                for(i=0;i<a;i++)
                {
                    for(j=0;j<b;j++)
                    {
                        pw.print(wrr[i][j]);
                    }
                    //pw.println("");
                }
            }
            t--;

        }
    }
}














/*import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
public final  class Main extends Thread  {
    boolean[] prime;
    FastScanner sc;
    PrintWriter pw;
    MathF mf;
    long startTime = System.currentTimeMillis();
    final class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            try {
                br = new BufferedReader(new InputStreamReader(System.in));
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        public long nlo() {
            return Long.parseLong(next());
        }

        public String next() {
            if (st.hasMoreTokens()) return st.nextToken();
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
            return st.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public String nli() {
            String line = "";
            if (st.hasMoreTokens()) line = st.nextToken();
            else try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            while (st.hasMoreTokens()) line += " " + st.nextToken();
            return line;
        }

        public double nd() {
            return Double.parseDouble(next());
        }
    }
    final class MathF {
        int bgsearch(int[] arr,int n,int x)
        {
            if(arr[n-1]<x)
                return -1;
            int l=0,r=n-1;
            int mid=(l+r)/2;
            int ans=n-1;
            while(l<r)
            {
                pw.println(l+" "+mid+" "+r);
                if(arr[mid]==x)
                    return mid;
                if(arr[mid]>x)
                {
                    r=mid-1;
                    ans=mid;
                }
                else
                    l=mid+1;
                mid=(l+r)/2;
            }
            return (arr[mid]>=x)?mid:ans;
        }
        int bsearch(int[] arr,int n,int x)
        {
            int l=0;
            int r=n-1;
            int mid=(l+r)/2;
            while(l<r)
            {
                if(arr[mid]==x)
                    return mid;
                else if(arr[mid]>x)
                    r=mid-1;
                else
                    l=mid+1;
            }
            return -1;
        }
        public  long gcd(long a, long b) {
            return (b == 0 ? a : gcd(b, a % b));
        }

        public  int nod(long x) {
            int i = 0;
            while (x != 0) {
                i++;
                x = x / 10;
            }
            return i;
        }

        public  int nob(long x) {
            if(x==0)
                return 1;
            return (int) Math.floor(Math.log(x) / Math.log(2)) + 1;
        }

        public int[] FastradixSort(int[] f) {
            int[] to = new int[f.length];
            {
                int[] b = new int[65537];
                for (int i = 0; i < f.length; i++) b[1 + (f[i] & 0xffff)]++;
                for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];
                for (int i = 0; i < f.length; i++) to[b[f[i] & 0xffff]++] = f[i];
                int[] d = f;
                f = to;
                to = d;
            }
            {
                int[] b = new int[65537];
                for (int i = 0; i < f.length; i++) b[1 + (f[i] >>> 16)]++;
                for (int i = 1; i <= 65536; i++) b[i] += b[i - 1];
                for (int i = 0; i < f.length; i++) to[b[f[i] >>> 16]++] = f[i];
                int[] d = f;
                f = to;
                to = d;
            }
            return f;
        }

        public  void Primesieve(int n) {
            for (int i = 0; i < n; i++)
                prime[i] = true;
            for (int p = 2; p * p < n; p++) {
                if (prime[p] == true) {
                    for (int i = p * p; i < n; i += p)
                        prime[i] = false;
                }
            }
        }
    };
    public Main(ThreadGroup t,Runnable r,String s,long d )
    {
        super(t,r,s,d);
    }
    public void run()
    {
        sc=new FastScanner();
        pw=new PrintWriter(System.out);
        mf=new MathF();
        solve();
        pw.flush();
        pw.close();
        System.err.println("\n[Time : " + (System.currentTimeMillis() - startTime) + " ms]");
    }
    public static void main(String[] args)
    {
        new Main(null,null,"",1<<20).start();
    }


    /////////////------------------------------------//////////////
    ////////////------------------Main-Logic--------//////////////
    ///////////-------------------------------------//////////////



    public void solve()
    {
        int t;
        t=1;
        while(t>0)
        {

            int n,i,j,k;
            ArrayList<Integer> listp=new ArrayList();
            ArrayList<Integer> listn=new ArrayList();
            n=sc.ni();
            for(i=0;i<n;i++)
            {
                j=sc.ni();
                if(j>0)
                    listp.add(j);
                else if(j<0)
                    listn.add(j);

            }
            Collections.sort(listp);
            Collections.sort(listn);
            int n1=listp.size();
            int n2=listn.size();
            int[] prr=new int[n1];
            int[] nrr=new int[n2];
            i=0;
            for(int x:listp)
                prr[i++]=x;
            i=0;
            for(int x:listn)
                nrr[i++]=x;
            long ans=0;
            i=0;
            for(i=1;i<n2;i++)
            {
                    if(nrr[i]%2==0)
                         j=mf.bgsearch(nrr,n2,nrr[i]/2);
                    else
                        j=mf.bsearch(nrr,n2,nrr[i]/2+1);
                    if(j!=-1)
                    {
                        if((i-j)>0)
                            ans+=(i-j);
                    }
            }
            t--;
        }
    }
}*/