#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
string s;
int main() {
  int i, j, n;
  cin >> s;
  ;
  n = s.length();
  vector<int> v(26, 1);
  v['a' - 'a'] = 0;
  v['e' - 'a'] = 0;
  v['i' - 'a'] = 0;
  v['o' - 'a'] = 0;
  v['u' - 'a'] = 0;
  int prev = 0;
  for (i = 0; i < n - 2; i++) {
    if (s[i] == s[i + 1] and s[i + 1] == s[i + 2]) continue;
    if (v[s[i] - 'a'] and v[s[i + 1] - 'a'] and v[s[i + 2] - 'a']) {
      int len = (i + 1) - prev + 1;
      string print = s.substr(prev, len);
      cout << print << " ";
      prev = i + 2;
      i++;
    }
  }
  if (n - prev > 0) cout << s.substr(prev, n - prev) << endl;
  return 0;
}
