#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int P = 1e9 + 7;
const int inf = 1e9;
const long long Inf = 1e15;
inline int IN() {
  char ch = getchar();
  int x = 0, f = 0;
  while (ch < '0' || ch > '9') ch = getchar(), f = (ch == '-');
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + ch - 48;
    ch = getchar();
  }
  return f ? (-x) : x;
}
inline int Pow(int x, int y, int p) {
  int an = 1;
  for (; y; y >>= 1, x = (long long)x * x % p)
    if (y & 1) an = (long long)an * x % p;
  return an;
}
void renew(int &x, int y) {
  x += y;
  if (x < 0)
    x += P;
  else if (x >= P)
    x -= P;
}
void setIO(string a) {
  freopen((a + ".in").c_str(), "r", stdin);
  freopen((a + ".out").c_str(), "w", stdout);
}
template <typename T>
inline void chkmin(T &a, const T &b) {
  if (a > b) a = b;
}
template <typename T>
inline void chkmax(T &a, const T &b) {
  if (a < b) a = b;
}
char s[10005];
int len;
int app[35], kd, cnt;
int dp[4005], pre[4005];
int add(char x) {
  if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') {
    for (int j = (int)0; j < (int)26; j++) app[j] = 0;
    kd = 0;
    cnt = 0;
    return 1;
  }
  x -= 'a';
  if (!app[x]) {
    app[x] = 1;
    kd++;
  }
  cnt++;
  if (cnt >= 3 && kd >= 2) return 0;
  return 1;
}
void dfs(int x) {
  if (!x) return;
  dfs(pre[x]);
  if (pre[x]) printf(" ");
  for (int i = (int)pre[x] + 1; i <= (int)x; i++) putchar(s[i]);
}
int main() {
  scanf("%s", s + 1);
  len = strlen(s + 1);
  int las = 1;
  dp[0] = 0;
  for (int i = (int)1; i <= (int)len; i++) dp[i] = 1 << 30;
  for (int i = (int)0; i <= (int)len; i++) {
    for (int j = (int)0; j < (int)26; j++) app[j] = 0;
    kd = 0;
    cnt = 0;
    for (int j = (int)i + 1; j <= (int)len; j++) {
      if (!add(s[j])) break;
      if (dp[i] + 1 < dp[j]) {
        dp[j] = dp[i] + 1;
        pre[j] = i;
      }
    }
  }
  dfs(len);
  puts("");
  return 0;
}
