#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void smn(T &a, const T &b) {
  if (b < a) a = b;
}
template <class T>
inline void smx(T &a, const T &b) {
  if (b > a) a = b;
}
namespace std {
template <class T, class U>
struct hash<pair<T, U>> {
  size_t operator()(const pair<T, U> &p) const {
    return hash<T>()(p.first) * 701 + hash<U>()(p.second);
  }
};
}  // namespace std
const double eps = 1e-8;
const int MN = 1000 * 1000;
string s;
bool v[MN];
long long cnt[MN];
double res = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> s;
  for (int i = 0; i < s.size(); i++)
    if (s[i] == 'I' || s[i] == 'E' || s[i] == 'O' || s[i] == 'A' ||
        s[i] == 'U' || s[i] == 'Y')
      v[i] = 1;
  for (int i = s.size() - 1; i >= 0; i--) cnt[i] = cnt[i + 1] + v[i];
  int n = s.size();
  long long now = count(v, v + n, true);
  res = now;
  for (int i = 2; i <= n; i++) {
    now += cnt[i - 1];
    now -= cnt[n - i + 1];
    res += (double)(now) / (i);
  }
  cout << fixed << setprecision(10) << res << '\n';
  return 0;
}
