#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
double D[1000003], B[1000003], A[1000003];
long long C[2003][2003];
string S;
int main() {
  long long T, i, j, k, l, r, s, a, b, c, d, x, y, z, m, n, t, p, q, curr, sum,
      ans, pos, val, countA;
  cin >> S;
  A[0] = 0;
  for (i = 1; i < 1000003; i++) {
    A[i] = A[i - 1] + 1.0 / i;
  }
  n = S.size();
  B[0] = 0;
  for (i = 1; i <= n; i++) {
    B[i] = B[i - 1] + 1.0 * (n + 1 - i) / i;
  }
  double ansR = 0;
  for (i = 0; i < n; i++) {
    if (S[i] == 'A' || S[i] == 'E' || S[i] == 'I' || S[i] == 'O' ||
        S[i] == 'U' || S[i] == 'Y') {
      a = i + 1;
      b = n - i;
      if (a > b) {
        t = a;
        a = b;
        b = t;
      }
      ansR += a;
      ansR += (a) * (A[b] - A[a]);
      ansR += B[n] - B[b];
    }
  }
  printf("%lf\n", ansR);
  return 0;
}
