Problem: When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Latin letters. The prettiness of the song is the prettiness of its title.

Let's define the simple prettiness of a word as the ratio of the number of vowels in the word to the number of all letters in the word.

Let's define the prettiness of a word as the sum of simple prettiness of all the substrings of the word.

More formally, let's define the function vowel(c) which is equal to 1, if c is a vowel, and to 0 otherwise. Let si be the i-th character of string s, and si..j be the substring of word s, staring at the i-th character and ending at the j-th character (sisi + 1... sj, i ≤ j).

Then the simple prettiness of s is defined by the formula:

<image>

The prettiness of s equals 

<image>

Find the prettiness of the given song title.

We assume that the vowels are I, E, A, O, U, Y.

Input

The input contains a single string s (1 ≤ |s| ≤ 5·105) — the title of the song.

Output

Print the prettiness of the song with the absolute or relative error of at most 10 - 6.

Examples

Input

IEAIAIO


Output

28.0000000


Input

BYOB


Output

5.8333333


Input

YISVOWEL


Output

17.0500000

Note

In the first sample all letters are vowels. The simple prettiness of each substring is 1. The word of length 7 has 28 substrings. So, the prettiness of the song equals to 28.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main{
    final boolean isFileIO =  false;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer st = new StringTokenizer("");
    String delim = " ";

    public static void main(String[] args) throws IOException {
        Main m = new Main();
        m.initIO();
        m.solve();
        m.in.close();
        m.out.close();
    }

    public void initIO() throws IOException {
        if(!isFileIO) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt"); 
        }
    }
  
    String nt() throws IOException {
        if(!st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken(delim);
    }

    String rl() throws IOException {
        return in.readLine();
    }

    int ni() throws IOException {
        return Integer.parseInt(nt());
    }

    long nl() throws IOException {
        return Long.parseLong(nt());
    }

    double nd() throws IOException {
        return Double.parseDouble(nt());
    }
    
    class Pair {
        public int x, y;
        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }
    } 

    public void solve() throws IOException {
        String s = rl();
        int n = s.length();
        long[] cntLeft = new long[n + 1];
        long[] cntRight = new long[n + 1];
        for(int i = 1; i <= n; i++) {
            cntLeft[i] = cntLeft[i - 1] + (isVowel(s.charAt(i - 1)) ? 1 : 0);
        }
        for(int i = n - 1; i >= 0; i--) {
            cntRight[i] = cntRight[i + 1] + (isVowel(s.charAt(i)) ? 1 : 0);   
        }
        long[] sumLeft = new long[n + 1];
        long[] sumRight = new long[n + 1];
        for(int i = 1; i <= n; i++) {
            sumLeft[i] = sumLeft[i - 1] + cntLeft[i];
        }
        for(int i = n - 1; i >= 0; i--) {
            sumRight[i] = sumRight[i + 1] + cntRight[i];
        }
        double ans = 0;
        for(int i = 1; i <= n; i++) {
            double a = (n - i + 1) * cntLeft[n] - (sumLeft[n - i] + sumRight[i]);
            ans += a / i;
        }
        out.println(ans);

    }

    public boolean isVowel(char a) {
        return a == 'I' || a == 'E' || a == 'A' || a == 'O' || a == 'U' || a == 'Y';
    }
}

class Utils {

    public static long binpow(long a, long exp, long mod) {
        if(exp == 0) {
            return 1;
        }
        if(exp % 2 == 0) {
            long temp = binpow(a, exp / 2, mod);
            return (temp * temp) % mod;
        } else {
            return (binpow(a, exp - 1, mod) * a) % mod;
        }
    }

    public static long inv(long a, long mod) {
        return binpow(a, mod - 2, mod);
    }

    public static long addmod(long a, long b, long mod) {
        return ((a + b) % mod + mod) % mod;
    }

    public static long gcd(long a, long b) {
        if(b == 0)
            return a;
        return gcd(b, a % b);
    }

    //mul must be < 10^18
    public static long mulmod(long a, long b, long mod) {
        return (a * b + (((a * b) / mod) + 1) * mod) % mod;
    }
}