#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500010;
char s[MAXN];
int sum[MAXN];
double rj;
int da(char c) {
  if (c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U' || c == 'Y')
    return 1;
  return 0;
}
int main() {
  scanf("%s", s);
  int n = strlen(s);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + da(s[i - 1]);
  int poc = 1, kraj = n;
  long long int sve = 0;
  while (true) {
    if (kraj < poc) break;
    sve += (long long int)(sum[kraj] - sum[poc - 1]);
    rj += (double)sve / poc;
    if (kraj == poc) break;
    rj += (double)sve / kraj;
    kraj--;
    poc++;
  }
  printf("%.9lf\n", rj);
  return 0;
}
