#include <bits/stdc++.h>
using namespace std;
char T[500010];
double psum1[500010], psum2[500010];
int n;
double solve() {
  psum1[1] = 1.0;
  for (int i = 2; i < 500010; i++) psum1[i] = psum1[i - 1] + 1.0 / i;
  psum2[1] = psum1[1];
  for (int i = 2; i < 500010; i++) psum2[i] = psum2[i - 1] + psum1[i];
  n = strlen(T);
  double ret = 0;
  for (int pos = 1; pos <= n; pos++) {
    char c = T[pos - 1];
    if (c == 'I' || c == 'E' || c == 'A' || c == 'O' || c == 'U' || c == 'Y') {
      ret += psum1[n - pos + 1];
      ret += psum2[n] - psum2[n - pos + 1];
      ret -= psum2[pos - 1];
    }
  }
  return ret;
}
int main() {
  scanf("%s", T);
  double ans = solve();
  printf("%.9lf\n", ans);
  return 0;
}
