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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef unsigned long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#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 REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

#define M 1000000007ULL

/* PA2017 POL */



int main() {

	
	bool b[200100];

	int cnt = 0;
	char c = getchar();
	while (c >= 'a' && c <= 'z')
	{
		bool sam = (c == 'a' || c == 'o' || c == 'e' || c == 'i' || c == 'u' || c == 'y');
		b[cnt] = sam;

		cnt++;
		c = getchar();
	}

	int last_three_loc = -1;

	LL bigsum = 0LL;
	FOR(i, 0, cnt-3)
	{
			bool sam = b[i];
			if (b[i+1] == sam && b[i+2] == sam)
			{
					LL left = i - last_three_loc;
					LL right = cnt - i - 2;
					bigsum += left * right;				
	//				printf("Three detected at pt %d! L(%lld), R(%lld), MUL(%lld) \n", i, left, right, left * right);

					last_three_loc = i;
			}


	}

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


	return 0;
}