#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char s[3030];
int dp[3030], pre[3030];
void print_ans(int u, int n) {
  if (u > n) return;
  for (int i = u; i < pre[u]; i++) putchar(s[i]);
  putchar(' ');
  print_ans(pre[u], n);
}
int main() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  memset(dp, 0x3f, sizeof(dp));
  dp[n + 1] = 0;
  for (int i = n; i >= 1; i--) {
    int cnt = 0;
    for (int j = i; j <= n; j++) {
      if (!strchr("aeiou", s[j]))
        cnt++;
      else
        cnt = 0;
      if (cnt == 3) {
        if (s[j - 2] == s[j - 1] && s[j - 1] == s[j]) {
          cnt = 2;
        } else
          break;
      }
      if (dp[j + 1] < 0x3f3f3f3f && dp[i] > dp[j + 1] + 1) {
        dp[i] = dp[j + 1] + 1;
        pre[i] = j + 1;
      }
    }
  }
  if (pre[1] == n + 1)
    puts(s + 1);
  else {
    print_ans(1, n);
  }
  return 0;
}
