#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e3 + 100;
int ans[maxn];
char s[maxn];
map<char, int> m;
void build() { m['a'] = 1, m['e'] = 1, m['i'] = 1, m['o'] = 1, m['u'] = 1; }
int main() {
  build();
  scanf("%s", s + 1);
  int n = (int)strlen(s + 1);
  for (int i = 1; i <= n; i++) {
    if (!m[s[i]]) {
      int k = 0;
      for (int j = i; j <= n; j++) {
        if (m[s[j]]) {
          i = j;
          break;
        }
        k++;
        if (k >= 3) {
          if (s[j] == s[j - 1] && s[j] == s[j - 2]) {
            for (int t = j + 1; t <= n; t++) {
              if (s[t] != s[t - 1]) {
                if (m[s[t]]) {
                  i = t;
                  break;
                } else {
                  ans[t] = 1;
                  i = t - 1;
                  break;
                }
              }
            }
          } else {
            ans[j] = 1;
            i = j - 1;
            break;
          }
          break;
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (ans[i]) {
      printf(" %c", s[i]);
    } else {
      printf("%c", s[i]);
    }
  }
  printf("\n");
  return 0;
}
