#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 100005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
set<char> vowel = {'A', 'O', 'Y', 'E', 'U', 'I', 'a', 'o', 'e', 'u', 'i'};
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b, long long mod) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long n, m, x, ans, a, b;
string ch;
set<char> ss;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> ch;
  n = ch.size();
  if (n < 3) {
    cout << ch;
    return 0;
  }
  long long i = 0;
  for (i = 0; i < ch.size() - 2;) {
    ss.clear();
    cout << ch[i];
    bool cond = true;
    for (int j = i; j < i + 3; j++) {
      if (vowel.count(ch[j]) == 1) {
        i++;
        cond = false;
        break;
      }
      ss.insert(ch[j]);
    }
    if (cond == false) continue;
    if (ss.size() == 1) {
      i++;
      continue;
    }
    cout << ch[i + 1] << " ";
    i += 2;
  }
  for (int j = i; j < n; j++) {
    cout << ch[j];
  }
  return 0;
}
