#include <bits/stdc++.h>
using namespace std;
string s;
queue<char> q;
vector<int> sp;
int main() {
  long long n, l = 0, r = 0, k = 0;
  cin >> s;
  if (s[0] != 'a' && s[0] != 'e' && s[0] != 'u' && s[0] != 'o' && s[0] != 'i') {
    q.push(s[0]);
    k = 1;
  }
  for (int i = 1; i < s.size(); i++) {
    if (s[i] != 'a' && s[i] != 'e' && s[i] != 'u' && s[i] != 'o' &&
        s[i] != 'i') {
      if (s[i] != s[i - 1]) q.push(s[i]);
      k++;
      if (k >= 3 && q.size() > 1) {
        sp.push_back(i);
        n = q.size();
        while (q.size() > 1) q.pop();
        k = 1;
      }
    } else {
      while (q.size() != 0) q.pop();
      k = 0;
    }
  }
  int j = 0;
  sp.push_back(s.size());
  for (int i = 0; i < s.size(); i++) {
    while (i < sp[j]) {
      cout << s[i];
      i++;
    }
    j++;
    if (i < s.size()) cout << ' ' << s[i];
  }
  return 0;
}
