#include <bits/stdc++.h>
using namespace std;
const int N = 500003;
int len;
char str[N];
double s[N], h[N], ans;
bool isyuan(char ch) {
  return ch == 'I' || ch == 'E' || ch == 'A' || ch == 'O' || ch == 'Y' ||
         ch == 'U';
}
int main() {
  scanf("%s", str + 1);
  len = strlen(str + 1);
  for (int i = 1; i <= len; ++i) {
    h[i] = h[i - 1] + (double)1 / (double)i;
    s[i] = s[i - 1] + h[i];
  }
  for (int i = 1; i <= len; ++i) {
    if (isyuan(str[i])) {
      ans += (s[len] - s[i - 1] - s[len - i]);
    }
  }
  printf("%lf", ans);
  return 0;
}
