1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair < int, int > PII;
typedef pair < LL, LL > PLL;
typedef pair < LD, LD > PDD;

#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
template < typename _T > inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template < typename _T, typename... args > void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#define __gcd gcd
#else
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

int n, vow[256];
string s;

bool good(int i)
{
    int ans = vow[s[i]] + vow[s[i + 1]] + vow[s[i + 2]];
    return ans == 0 || ans == 3;
}

int main()
{
    _upgrade
    cin >> s;
    n = sz(s);

    vector < int > vec = {'a', 'e', 'i', 'o', 'u', 'y'};
    for(auto c: vec)
        vow[c] = 1;

    LL ans = 0, last = -1;
    for(LL i = 0; i + 2 < n; i++)
    {
        if(good(i))
        {
            ans += (i - last) * (n - i - 2);
            last = i;
        }
    }  
    cout << ans << "\n";
	return 0;
}