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

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;

#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 ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())

#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXSIZE 200010

char typy[]={'a','e','i','o','u','y'};
int tab[MAXSIZE];

int typ(char c){	//1==samogloska
	
	REP(i,6){
		if(c==typy[i])
			return 2; 
	}
	return 3;		//2==spolgloska
}

string s;//аа

int main(){
	
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	
	REP(i,SIZE(s)){
		tab[i+1]=typ(s[i]);
	}
	
	LL wyn=0;	
	LL ost=0;
	
	FOR(i,3,SIZE(s)){
		if(tab[i]==tab[i-1]&&tab[i-1]==tab[i-2]){
			wyn+=i-2;
			ost=i;
		}
		else
			wyn+=max(0LL,ost-2);
	}
	
	cout<<wyn;
	
	return 0;
}