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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pi pair<int,int>
#define pd pair<ld,ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i,a,b) for(int i=(a); i<=(b);i++)
#define F(i,a,b) FOR(i,(a),(b)-1)
#define REV(i,a,b) for(int i=(a); i>=(b);i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)

const long long inf = 1000*1000*1000+7;
const long long INF = LLONG_MAX;
const long long MOD = inf;
const long long P = 997;
const long long N = 3e5+10, base=1<<19;
string s;
int tab[N];

void solve(){
    cin>>s;
    int n=s.size();
    FOR(i,1,n)
    {
        if(s[i-1]=='a' ||
            s[i-1]=='e' ||
            s[i-1]=='i' ||
            s[i-1]=='o' ||
            s[i-1]=='u' ||
            s[i-1]=='y')
            tab[i]=1;
    }
    VI v;
    FOR(i,1,n)
        if(i>=3 && tab[i] == tab[i-1] && tab[i-1] == tab[i-2])
            v.pb(i);
    reverse(all(v));
    int res=0;
    FOR(i,1,n)
    {
        while(sz(v) && i + 2 > v.back())
            v.pop_back();
        if(sz(v))
            res+=n-v.back()+1;
    }
    cout<<res<<"\n";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cerr.tie(0);
    cout<<setprecision(9)<<fixed;
    cerr<<setprecision(6)<<fixed;
    int test = 1;
//    cin>>test;
    while(test--){
    	solve();
    }
}
/*
2
1 5 0
5 2 11

*/