#include <bits/stdc++.h>
using namespace std;
const int MAXN = 412345;
const int MAXINT = 2047483098;
const long long int MOD = 1e9 + 7;
const int MAX = 1e4;
const long double pi = 2 * acosl(0);
const long double EPS = 1e-10;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isPrime(long long unsigned n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int nCr(int n, int r) {
  int res = 1;
  if (n < r) return -1;
  r = min(r, n - r);
  for (long long unsigned int i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
int nPr(int n, int r) {
  int res = 1;
  if (n < r) return -1;
  for (long long unsigned int i = 0; i < r; i++) res *= (n - i);
  return res;
}
long long int fact(long long int n) {
  if (n == 1 || n == 0)
    return 1;
  else
    return (n % MOD) * fact(n - 1) % MOD;
}
void solve() {
  string s;
  cin >> s;
  long long int load = 0;
  string ans = "";
  for (long long int i = 0; i < s.length(); i++) {
    if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' ||
        s[i] == 'u') {
      load = 0;
      ans.push_back(s[i]);
    } else {
      if (load == 0) {
        ans.push_back(s[i]);
        load++;
      } else if (load == 1) {
        ans.push_back(s[i]);
        load++;
      } else {
        if (s[i] == ans[ans.length() - 1] && s[i] == ans[ans.length() - 2]) {
          ans.push_back(s[i]);
        } else {
          cout << ans << " ";
          load = 1;
          ans = "";
          ans.push_back(s[i]);
        }
      }
    }
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T;
  T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
