#include <bits/stdc++.h>
using namespace std;
char s[] = {"AEIOUY"};
const int MAXN = 5e5 + 10;
bool jd(char ch) {
  for (int i = 0; i < 6; i++)
    if (ch == s[i]) return true;
  return false;
}
int n;
long double ans = 0;
long double sum[MAXN];
char a[MAXN];
void cal(int x, int y) {
  if (x > y) return;
  if (x == y) {
    if (jd(a[x])) ans += 1;
    return;
  }
  int mid = (x + y) / 2;
  cal(x, mid);
  cal(mid + 1, y);
  int rl = y - mid;
  long double q = 0;
  for (int i = x; i <= mid; i++) {
    int l = mid - i + 1;
    int r = l + rl;
    q += sum[r] - sum[l];
    if (jd(a[i])) ans += q;
  }
  int ll = mid - x + 1;
  q = 0;
  for (int i = y; i > mid; i--) {
    int l = i - mid;
    int r = ll + l;
    q += sum[r] - sum[l];
    if (jd(a[i])) ans += q;
  }
}
int main() {
  cin >> a;
  n = strlen(a);
  sum[1] = 1;
  long double p = 1;
  for (int i = 2; i <= n; i++) {
    sum[i] = p / i;
    sum[i] += sum[i - 1];
  }
  cal(0, n - 1);
  double x = ans;
  printf("%.10f\n", x);
  return 0;
}
