#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>

using namespace std;

int st[100], lit[200], n;
char S[9];

void Init(int k)
{
    st[k] = 0;
}

int Succesor(int k)
{
    if(st[k] < n)
    {
        st[k]++;
        return 1;
    }
    return 0;
}

int Valid(int k)
{
    for(int i = 1; i <  k; i++)
        if(st[k] == st[i])
            return 0;
    return 1;
}

int Solutie(int k)
{
    if(k == n+1)
        return 1;
    return 0;
}


ofstream fout("anagrame1.out");
void Tipar()
{
    int l, l2, l3;
    for(int i = 1; i <= n-2; i++)
    {
        l  = S[st[i]-1];
        l2 = S[st[i+1]-1];
        l3 = S[st[i+2]-1];
        //fout << "-" << l << l2 << l3 << "\n";
        if(lit[l] == lit[l2] == lit[l3] == 0)
            return;
    }
    for(int i = 1; i <= n; i++)
        fout << S[st[i]-1];
    fout << "\n";
}

void backtrack(int k)
{
    if(Solutie(k))
        Tipar();
    else
    {
        Init(k);
        while(Succesor(k))
            if(Valid(k))
                backtrack(k+1);
    }
}

int main()
{
    lit['a'] = lit['e'] = lit['i'] = lit['o'] = lit['u'] = 1;
    lit['A'] = lit['E'] = lit['I'] = lit['O'] = lit['U'] = 1;
    ifstream fin("anagrame1.in");
    fin.getline(S, 9);
    n = strlen(S);
    sort(S, S+n);
    backtrack(1);
    fin.close();
    return 0;
}