#include <bits/stdc++.h>
using namespace std;
int chh;
const int N = 3005;
int n;
string s;
bool f[30];
bool ok(int p, int id) {
  if (id - p < 2) return 1;
  if (f[s[id] - 'a']) return 1;
  if (f[s[id - 1] - 'a']) return 1;
  if (f[s[id - 2] - 'a']) return 1;
  if (s[id] == s[id - 1] && s[id] == s[id - 2]) return 1;
  return 0;
}
int main() {
  int d, flag;
  memset(f, 0, sizeof(f));
  f['a' - 'a'] = 1;
  f['e' - 'a'] = 1;
  f['i' - 'a'] = 1;
  f['o' - 'a'] = 1;
  f['u' - 'a'] = 1;
  while (cin >> s) {
    n = (s).size();
    for (int i = 0; i < n; i++) {
      d = i;
      while (i + 1 < n && ok(d, i + 1)) i++;
      cout << s.substr(d, i - d + 1);
      if (i != n - 1)
        cout << ' ';
      else
        cout << '\n';
    }
  }
  return 0;
}
