#include <bits/stdc++.h>
using namespace std;
string s;
int dp[3000];
bool bad[128];
bool ok[3000][3000];
bool wa[3000][3000];
int sol[3000];
int calc(int i) {
  if (i == s.size()) return 0;
  int &ret = dp[i];
  if (ret != -1) return ret;
  ret = 1e9;
  for (int j = s.size() - 1; j >= 0; --j) {
    if (ok[i][j] || !wa[i][j]) {
      int cur = 1 + calc(j + 1);
      if (ret > cur) {
        ret = cur;
        sol[i] = j + 1;
      }
    }
  }
  return ret;
}
int main() {
  string v = "aeiou";
  memset(bad, true, sizeof(bad));
  for (auto x : v) bad[x] = false;
  cin >> s;
  for (int i = 0; i < s.size(); ++i) {
    bool same = true;
    bool seen = false;
    for (int j = i; j < s.size(); ++j) {
      same &= s[j] == s[i];
      ok[i][j] = same;
      if (j - i + 1 >= 3 && bad[s[j]] && bad[s[j - 1]] && bad[s[j - 2]] &&
          (s[j] != s[j - 1] || s[j] != s[j - 2] || s[j - 1] != s[j - 2]))
        seen = true;
      wa[i][j] = seen;
    }
  }
  memset(dp, -1, sizeof(dp));
  calc(0);
  int cur = 0;
  while (cur != s.size()) {
    cout << s.substr(cur, sol[cur] - cur) << " ";
    cur = sol[cur];
  }
  return 0;
}
