#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 3000 + 5;
int n;
string s;
int dp[maxn];
int rv[maxn];
int f[256];
int calc(int pos) {
  if (pos == n) return 0;
  int& res = dp[pos];
  if (~res) return res;
  res = INF;
  int num = 0, msk = 0;
  for (int i = (pos); i < (n); i++) {
    char c = s[i];
    if (!f[c]) {
      num++;
      msk |= 1 << c - 'a';
    } else {
      num = msk = 0;
    }
    if (num >= 3 && __builtin_popcountll(msk) > 1) {
      break;
    }
    if (chkmin(res, calc(i + 1) + 1)) {
      rv[pos] = i + 1;
    }
  }
  return res;
}
void solve() {
  f['a'] = f['e'] = f['i'] = f['o'] = f['u'] = 1;
  cin >> s;
  n = int((s).size());
  memset(dp, -1, sizeof(dp));
  calc(0);
  int pos = 0;
  string res = "";
  while (pos < n) {
    int npos = rv[pos];
    if (int((res).size())) res += " ";
    res += s.substr(pos, npos - pos);
    pos = npos;
  }
  cout << res << "\n";
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
