#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int ts, kk = 1;
char ls[] = {"aeiou"};
bool ok[256];
char s[3005];
char rs[6005];
int n;
int p[3005];
int qq[3005];
int dp(int i) {
  if (i == n) return 0;
  int &pr = p[i];
  if (pr != -1) return pr;
  int &qr = qq[i];
  pr = 1000000007LL;
  int k;
  for (int j = i; j < n; j++) {
    if (j - i + 1 >= 3) {
      char q[3];
      for (k = 0; k < 3; k++) {
        q[k] = s[j - k];
        if (ok[q[k]]) break;
      }
      if (k == 3) {
        sort(q, q + 3);
        if (q[0] != q[2]) {
          break;
        }
      }
    }
    int q = dp(j + 1) + 1;
    if (q < pr) {
      pr = q;
      qr = j;
    }
  }
  return pr;
}
void prnt(int i, int sz) {
  if (i == n) {
    rs[sz] = 0;
    return;
  }
  int q = qq[i];
  if (sz) rs[sz++] = ' ';
  for (; i <= q; i++) rs[sz++] = s[i];
  prnt(i, sz);
}
int main() {
  int t, i, j, k;
  memset(p, -1, sizeof(p));
  for (i = 0; i < 5; i++) ok[ls[i]] = 1;
  scanf("%s", s);
  n = strlen(s);
  k = dp(0);
  prnt(0, 0);
  printf("%s\n", rs);
  return 0;
}
