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

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 200010;
const int C = 262144;
const int INF = 1000000001;

char sam[7] = {'e', 'y', 'u', 'i', 'o', 'a'};

bool czySam(char x) {
	FOR(i, 0, 5)
		if(sam[i] == x)
			return 1;
	return 0;
}

bool czyTrudny(char x, char y, char z) {
	if(czySam(x) && czySam(y) && czySam(z) )
		return 1;
	if(!czySam(x) && !czySam(y) && !czySam(z) )
		return 1;
	return 0;
}

char a[MXN];

int main() {
	scanf("%s", a + 1);
	int n = strlen(a + 1);

	LL res = 0;
	int last = -1;

	FOR(i, 3, n) {
		if(czyTrudny(a[i - 2], a[i - 1], a[i]) )
			last = i;
		if(last != -1)
			res += last - 2;
	}

	printf("%lld\n", res);

	return 0;
}