#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
void YES(bool t = true) { cout << (t ? "YES" : "NO") << endl; }
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long inf = 1000000001;
const long long INF = (long long)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(long long t) { return __builtin_popcountll(t); }
vector<int> dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
struct Setup_io {
  Setup_io() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(25);
  }
} setup_io;
const long long MOD = 1000000007;
signed main() {
  string s;
  cin >> s;
  string t;
  set<char> st;
  st.insert('a');
  st.insert('i');
  st.insert('u');
  st.insert('e');
  st.insert('o');
  for (int i = 0; i < (int)(s.size()); i++) {
    if (t.size() >= 2 and not st.count(t.back()) and
        not st.count(t[t.size() - 2]) and not st.count(s[i])) {
      if (not(t.back() == t[t.size() - 2] and t.back() == s[i])) {
        cout << t << " ";
        t.clear();
      }
    }
    t += s[i];
  }
  cout << t << endl;
}
