#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(nullptr);
  cin.tie(nullptr);
  solve();
}
const int MAXN = 3010;
int dp[MAXN];
int from[MAXN];
bool is_consonant(char c) {
  return c != 'a' && c != 'e' && c != 'i' && c != 'u' && c != 'o';
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  for (int i = 0; i < n; i++) {
    dp[i] = 1e+9;
    int cnt = 0;
    bool same = true;
    char val = s[i];
    for (int j = i; j >= 0; j--) {
      if (is_consonant(s[j])) {
        if (cnt == 0) {
          same = true;
          val = s[j];
        }
        cnt++;
        if (val != s[j]) {
          same = false;
        }
      } else {
        cnt = 0;
        same = true;
      }
      if (same || cnt < 3) {
        int pred = j == 0 ? 0 : dp[j - 1];
        pred++;
        if (pred < dp[i]) {
          dp[i] = pred;
          from[i] = j;
        }
      } else {
        break;
      }
    }
  }
  int cur = n - 1;
  vector<string> res;
  while (cur != -1) {
    res.push_back(s.substr(from[cur], cur - from[cur] + 1));
    cur = from[cur] - 1;
  }
  reverse(res.begin(), res.end());
  for (const auto& s : res) {
    cout << s << ' ';
  }
  cout << endl;
}
