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
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int MAXN=200000+5;
unsigned char t[MAXN];
int tr[256];

inline long long int countFragments(long long int l) {
    return (l*(l-1)) >> 1;
}

int main() {
    ios_base::sync_with_stdio(0);
    long long int result = 0;
    
    tr['a'] = 1;
    tr['e'] = 1;
    tr['i'] = 1;
    tr['o'] = 1;
    tr['u'] = 1;
    tr['y'] = 1;
    
    scanf("%s", t);
    
    long long int i = 1;
    long long int l = 1;
    int c = tr[t[0]], pc = 2, ppc;
    while (t[i]) {
//        cout << t[i] << "\n";
        ppc = pc;
        pc = c;
        c = tr[t[i++]];
        //cout<<(int)c<<"\n";
        if (ppc == pc && c == pc) {
            result += countFragments(l);
            l = 2;
        } else {
            l++;
        }
    }
    result += countFragments(l);
    result = countFragments(i) - result;
    
    printf("%lld\n", result);
    return 0;
}