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
#include <bits/stdc++.h>


using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

const int INF = 1000000001;
const LD EPS = 1e-9;
//const int MOD = 1000000007;
const LL LLINF = 1000000000000000001;

//813437586

#define FOR(i, b, e) for (int i = b; i <= e; i++)
#define FORD(i, b, e) for (int i = b; i >= e; i--)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define VAR(v, n) auto v = (n)
#define FOREACH(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define DPRINT(x) cout << #x << ": " << x << endl
#define BOOST ios_base::sync_with_stdio(false); cin.tie(0)

#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define GGL(x) "Case #" << x << ": "

/*************************** END OF TEMPLATE ***************************/




const int maxn = 200042;

set<char> vov = {'a', 'e', 'i', 'o', 'u', 'y'};

int a[maxn];
int b[maxn];



int main()
{
	BOOST;

	string s;
	cin >> s;

	FORD(i, SIZE(s) - 1, 0)
	{
		if(vov.find(s[i]) != vov.end())
		{
			a[i] = 0;
			b[i] = b[i + 1] + 1;
		}
		else
		{
			a[i] = a[i + 1] + 1;
			b[i] = 0;
		}
	}

	int last = -1;
	LL ans = 0;

	FORD(i, SIZE(s) - 1, 0)
	{
		if(a[i] >= 3 || b[i] >= 3)
			last = i;
		if(last != -1)
			ans += SIZE(s) - last - 2;
	}

	cout << ans << '\n';

}