#include <bits/stdc++.h>
using namespace std;
char A[551111];
long long tag[551111];
int ln;
double res;
int main() {
  scanf("%s", A + 1);
  ln = strlen(A + 1);
  for (int i = 1; i <= ln; i++)
    if (A[i] == 'I' || A[i] == 'E' || A[i] == 'A' || A[i] == 'O' ||
        A[i] == 'U' || A[i] == 'Y') {
      int ck = min(i - 1, ln - i);
      int l1, l2, r1, r2;
      r1 = ln - ck;
      r2 = ln;
      tag[1]++;
      tag[ck + 2]--;
      tag[r1 + 1]--;
    }
  for (int i = 1; i <= ln; i++) tag[i] += tag[i - 1];
  for (int i = 1; i <= ln; i++) tag[i] += tag[i - 1];
  for (int i = 1; i <= ln; i++) res += (double)tag[i] * 1 / i;
  printf("%lf\n", res);
  return 0;
}
