#include <bits/stdc++.h>
using namespace std;
long long a[5000007], b[5000007];
long long mod = 1e9 + 7;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    long long i, j = 0, k, l, ans = 0, count = 0, n, m, x, y;
    bool flag = 0;
    string s;
    long long maxa = -1000000000000000, mina = 1000000000000000;
    cin >> s;
    n = s.length();
    map<long long, long long> make_pair;
    for (i = 0; i < n; i++) {
      make_pair[s[i]]++;
      if (s[i] != 'a' && s[i] != 'e' && s[i] != 'i' && s[i] != 'o' &&
          s[i] != 'u') {
        count++;
        if (count == 3 && (s[i - 2] != s[i] || s[i - 1] != s[i])) {
          count = 1;
          a[j++] = i;
        } else if (count == 3 && s[i - 2] == s[i] && s[i] == s[i - 1])
          count = 2;
      } else
        count = 0;
    }
    j = 0;
    for (i = 0; i < n; i++) {
      if (i == a[j]) {
        j++;
        cout << " " << s[i];
      } else
        cout << s[i];
    }
  }
}
