#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const long long big = 1000000007ll;
const long long big2 = 1000000009ll;
long long n, m, k, q, w, h;
string vows = "aeiou";
string s;
bool vow[30] = {0};
int main() {
  long long a, b, c, d, e;
  for (long long c1 = 0; c1 < 5; c1++) {
    vow[vows[c1] - 'a'] = 1;
  }
  cin >> s;
  string ans = "";
  n = s.length();
  long long cns = 0;
  bool same = 0;
  long long prev = -1;
  for (long long c1 = 0; c1 < n; c1++) {
    a = s[c1] - 'a';
    if (!vow[a]) {
      if (cns == 0) {
        same = 1;
        cns++;
      } else {
        if ((!same) || (cns >= 2 && a != prev)) {
          ans += " ";
          same = 1;
          cns = 1;
        } else {
          if (a != prev) same = 0;
          cns++;
        }
      }
    } else {
      cns = 0;
      same = 0;
    }
    prev = s[c1] - 'a';
    ans += s[c1];
  }
  cout << ans << "\n";
  return 0;
}
