#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
char a[N];
int n;
int f[N];
int g[N];
bool fu(char x) {
  if ((x == 'a') || (x == 'e') || (x == 'i') || (x == 'o') || (x == 'u'))
    return 0;
  return 1;
}
void out(int x) {
  if (!x) return;
  out(g[x]);
  for (int i = (int)g[x] + 1; i <= (int)x; i++) putchar(a[i]);
  if (x != n)
    putchar(' ');
  else
    putchar('\n');
}
int main() {
  scanf("%s", a + 1);
  n = strlen(a + 1);
  memset(f, 63, sizeof f);
  f[0] = 0;
  for (int i = (int)1; i <= (int)n; i++) {
    bool same = 1;
    int now = 0;
    int pp = i;
    for (int j = (int)i; j >= (int)1; j--) {
      same &= (a[j] == a[pp]);
      if (fu(a[j])) {
        ++now;
        if (now == 1) {
          same = 1;
          pp = j;
        }
      } else {
        now = 0;
      }
      if ((!same) && now >= 3) break;
      if (f[j - 1] + 1 < f[i]) {
        f[i] = f[j - 1] + 1;
        g[i] = j - 1;
      }
    }
  }
  out(n);
  return 0;
}
