#include <bits/stdc++.h>
using namespace std;
const int LEN = 606060;
int n, b[LEN];
long long s[LEN], ms[LEN], rs[LEN];
double a[LEN];
int vowel(char ch) {
  if (ch == 'I' || ch == 'E' || ch == 'A' || ch == 'O' || ch == 'U' ||
      ch == 'Y')
    return 1;
  return 0;
}
double getSum(long long *a, int l, int r) {
  if (l > r) return 0.0;
  long long s = a[r], t = 0;
  if (l > 0) t = a[l - 1];
  return s - t;
}
double rGetSum(long long *a, int l, int r) {
  if (l > r) return 0.0;
  return a[l] - a[r + 1];
}
void calc() {
  s[0] = ms[0] = b[0];
  for (int i = 1; i < n; i++) {
    s[i] = s[i - 1] + b[i];
    ms[i] = ms[i - 1] + (i + 1) * b[i];
  }
  rs[n - 1] = b[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    rs[i] = rs[i + 1] + (n - i) * b[i];
  }
  double res = 0.0;
  int j = 0;
  for (int len = 1; len <= n; len++) {
    if (len <= (n + 1) / 2) {
      double tmp = len * getSum(s, len - 1, n - len);
      tmp += getSum(ms, 0, len - 2);
      tmp += rGetSum(rs, n - len + 1, n - 1);
      res += tmp / len;
      a[len] = tmp;
    } else {
      if (len == 1 + (n + 1) / 2) {
        if (n & 1)
          j = len - 2;
        else
          j = len - 1;
      }
      res += a[j--] / len;
    }
  }
  printf("%.10f\n", res);
}
int main() {
  string s;
  cin >> s;
  n = s.length();
  for (int i = 0; i < n; i++) b[i] = vowel(s[i]);
  calc();
  return 0;
}
