#include <bits/stdc++.h>
using namespace std;
int binarySearch(int arr[], int l, int r, int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return -1;
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) {
    result = gcd(arr[i], result);
    if (result == 1) {
      return 1;
    }
  }
  return result;
}
bool io(long long n) {
  if (n % 2 == 1) {
    return 1;
  } else {
    return 0;
  }
}
bool isvow(char c) {
  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
    return true;
  } else {
    return false;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  long long count = 0;
  for (long long i = 0; i < s.size(); i++) {
    if (isvow(s[i])) {
      count = 0;
      cout << s[i];
    } else {
      count++;
      if (count < 3) {
        cout << s[i];
      } else {
        if (s[i - 2] == s[i - 1] && s[i] == s[i - 1]) {
          cout << s[i];
          count = 2;
        } else {
          cout << " " << s[i];
          count = 1;
        }
      }
    }
  }
  return 0;
}
