#include <bits/stdc++.h>
using namespace std;
string s;
int a[262145 * 2];
double b[262145 * 2];
int n, l, r, j;
double ans, i, now;
long long sum, cons;
int main() {
  cin >> s;
  for (i = 0; i < s.size(); i++)
    if (s[i] == 'I' || s[i] == 'E' || s[i] == 'A' || s[i] == 'O' ||
        s[i] == 'U' || s[i] == 'Y') {
      a[(int)i + 1] = 1;
      sum++;
      b[(int)i + 1] = 1000000000;
    } else
      b[(int)i + 1] = 1000000000;
  l = 1;
  n = s.size();
  r = n;
  for (i = 1; i * 2 <= n; i++) {
    if (sum < 0) sum = 0;
    now = sum * i;
    now += cons;
    ans += now / i;
    if (b[l] != 1000000000) cons -= b[l] * a[l];
    if (b[r] != 1000000000) cons -= b[r] * a[r];
    sum -= a[l];
    sum -= a[r];
    b[l] = min(b[l], i);
    b[r] = min(b[r], i);
    cons += b[l] * a[l];
    cons += b[r] * a[r];
    l++;
    r--;
  }
  sum = 0;
  for (j = 1; j <= n; j++) b[j] = 1, sum += a[j];
  cons = 0;
  j = i;
  l = 1;
  r = n;
  for (i = n; i >= j; i--) {
    now = sum * (n + 1 - i);
    now += cons;
    ans += now / i;
    b[l] = (n + 1 - i);
    b[r] = (n + 1 - i);
    cons += b[l] * a[l] + b[r] * a[r];
    sum -= a[l];
    sum -= a[r];
    l++;
    r--;
  }
  printf("%.9f\n", ans);
  return 0;
}
