#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

const int N = 2e5 + 7;
char Tab[N];
string s;

bool Vowel (char c)
{
    return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y' || c == 'o';
}

bool Check (int i)
{
    bool a = Vowel(s[i]), b = Vowel(s[i + 1]), c = Vowel(s[i + 2]);
    return (a == b && b == c);
}

void Solve ()
{
    int n = s.size(), it = 0;
    LL result = 0LL;
    
    for (int i = 0; i < n; ++i)
    {   
        it = max(it, i);
        while (it < n - 2 && !Check(it))
            ++it;

        if (it >= n - 2)
            break;

        result += (LL)(n - it - 2);
    }

    printf("%lld", result);
}   

int main ()
{
    scanf("%s", Tab);
    s = Tab;
    Solve();

    return 0;
}