#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MAX = 1e18 + 1;
const int NN = 1e5 + 5;
const int mod = 1e9 + 7;
void solve() {
  string s1;
  cin >> s1;
  char vow[] = {'a', 'e', 'o', 'u', 'i'};
  vector<int> ans;
  int i = 0;
  while (i < s1.size()) {
    set<char> s;
    for (int j = i; j < min(i + 3, (int)s1.size()); j++) {
      s.insert(s1[j]);
    }
    int cnt = 0;
    if (s.size() != 1) {
      for (auto ch : s) {
        for (int y = 0; y < 5; y++) {
          if (ch == vow[y]) cnt++;
        }
      }
      if (cnt == 0) {
        ans.push_back(i + 1);
        i++;
      }
    }
    i++;
  }
  int k = 0;
  for (int y = 0; y < s1.size(); y++) {
    cout << s1[y];
    if (k < ans.size() && y == ans[k]) {
      cout << " ";
      k++;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  while (tt--) solve();
  return 0;
}
