#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

const int N=110;

char str[N];

bool cmp(char a,char b)
{
    int x,y;
    if(a>='a'&&a<='z')
    x=a-'a';
    else
    x=a-'A';
    if(b>='a'&&b<='z')
    y=b-'a';
    else
    y=b-'A';
    return x<y;
}

int main()
{
	while(cin.getline(str,N))
	{
	    vector<pair<int,char>> flag;
	    string s;
	    for(int i=0;i<strlen(str);i++)
	    {
	        if(str[i]>='a'&&str[i]<='z'||str[i]>='A'&&str[i]<='Z')
	        s.push_back(str[i]);
	        else
	        flag.push_back({i,str[i]});
	    }
	    stable_sort(s.begin(),s.end(),cmp);
	    for(int i=0;i<flag.size();i++)
	    s.insert(s.begin()+flag[i].first,flag[i].second);
	    cout<<s;
	}
	return 0;
}