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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

string x;

bool samo(char y) {
	return y == 'a' || y == 'e' || y == 'i' || y == 'o' || y == 'u' || y == 'y';
}

bool canAdd(int poz) {
	if (poz == SIZE(x)) {
		return false;
	}
	bool samog = samo(x[poz - 2]) && samo(x[poz - 1]) && samo(x[poz]);
	bool sp = !samo(x[poz - 2]) && !samo(x[poz - 1]) && !samo(x[poz]);
	return !samog && !sp;
}

int main() {
	cin >> x;
	ll res = 0;
	int k = 0;
	ll len = SIZE(x);
	REP(p, len) {
		k = min(max(p + 2, k), (int)len);
		while (k < len && canAdd(k)) {
			++k;
		}
		res += (k - p);
	}
	cout << (len * (len + 1))/2 - res << endl;
	return 0;
}