#include <string>
#include <vector>
#include <list>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
using namespace std;

class Solution {
public:
    string sortVowels(string s);
};

string Solution::sortVowels(string s)
{
  vector <int> count;
  int i;
  int j;
  unsigned long long mask;
  string v, rv;

  v = "AEIOUaeiou";
  mask = 0;
  for (i = 0; i < v.size(); i++) mask |= (1ULL << (unsigned long long) (v[i]-'A'));

  count.resize(128, 0);

  for (i = 0; i < s.size(); i++) if (mask & (1ULL << (unsigned long long) (s[i]-'A'))) count[s[i]]++;

  j = 0;
  for (i = 0; i < s.size(); i++) {
    if (mask & (1ULL << (unsigned long long) (s[i]-'A'))) {
      while (count[v[j]] == 0) j++;
      rv.push_back(v[j]);
      count[v[j]]--;
    } else {
      rv.push_back(s[i]);
    }
  }
  return rv;
}

int main()
{
  Solution s;
  string x;

  if (getline(cin, x)) cout << s.sortVowels(x) << endl;
  return 0;
}