#include <bits/stdc++.h>
using namespace std;
long long sum[1000001], sum1[1000001];
long long cnt[1000001];
char s[1000001];
int main() {
  gets(s);
  int L = strlen(s);
  for (int i = 0; i < L; i++) {
    if (s[i] == 'I' || s[i] == 'E' || s[i] == 'A' || s[i] == 'O' ||
        s[i] == 'U' || s[i] == 'Y') {
      if (i > 0)
        sum[i] += (i + 1 + sum[i - 1]);
      else
        sum[i] = 1;
      if (i > 0)
        cnt[i] = cnt[i - 1] + 1;
      else
        cnt[i] = 1;
    } else if (i > 0) {
      cnt[i] = cnt[i - 1];
      sum[i] = sum[i - 1];
    }
  }
  for (int i = L - 1; i >= 0; i--) {
    if (s[i] == 'I' || s[i] == 'E' || s[i] == 'A' || s[i] == 'O' ||
        s[i] == 'U' || s[i] == 'Y') {
      sum1[i] += (L - i + sum1[i + 1]);
    } else
      sum1[i] = sum1[i + 1];
  }
  double ans = 0;
  for (int len = 1; len <= L; len++) {
    if (2 * len <= L)
      ans += (sum[len - 1] + sum1[L - len] +
              (cnt[L - len - 1] - cnt[len - 1]) * len) /
             double(len);
    else if (L > len)
      ans += ((sum[L - len - 1] + sum1[len]) +
              (cnt[len - 1] - cnt[L - len - 1]) * (L - len + 1)) /
             double(len);
    else if (L == len)
      ans += cnt[L - 1] / (double)L;
  }
  printf("%.6f\n", ans);
  return 0;
}
