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
// Author: Krzysztof Bochenek
// Email:  kpbochenek@gmail.com
// --------------------------------
#include <stdio.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>
#include <climits>

#define pb push_back
#define mp make_pair

typedef long long int ll;
typedef unsigned long long ull;

using namespace std;

#define rep(i, n) for(int i=0; i<n; ++i)

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


int main() {
  ios::sync_with_stdio(0);

  string s;
  cin >> s;

  ull result = 0;

  bool csam=false;
  int cnt=0;

  int last_found = -1;

  for (int i=0; i<s.size(); ++i) {
    char c = s[i];

    if (is_sam(c) && csam) {
      cnt++;
    } else if (!is_sam(c) && !csam) {
      cnt++;
    } else {
      cnt=1;
      csam = !csam;
    }

    if (cnt >= 3) {
      last_found = i-2;
    }

    if (last_found != -1) {
      result += last_found+1;
    }
  }

  cout << result << endl;

  return 0;
}