关于一些初级ACM竞赛题目的分析和题解（二）。

     关于一些初级ACM竞赛题目的分析和题解（二）。

今天写了关于排序的题  中间有加号的复杂的一行字符   其次还有关于tolower函数的应用， 上题                                                                                                                                       

A. Helpful Maths

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.

The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.

You've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.

Input

The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long.

Output

Print the new sum that Xenia can count.

Examples

input

3+2+1

output

1+2+3

input

1+1+3+1+3

output

1+1+1+3+3

input

2

output

2

简单的排序题s<=100，加号不变数字升序排好，下面是代码，用冒泡排序法排列：

#include<cstdio>
	char s[200];//   定义字符串；
	int main()
{
int i,j;
scanf("%s",s);//    输入字符串
for(i=0;s[i];i+=2)//  开始冒泡排序
 for(j=i;s[j];j+=2)
 if(s[i]>s[j])
 s[i]^=s[j]^=s[i]^=s[j];//   升序排序
puts(s);//  输出字符串
}

A. String Task

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:

• deletes all the vowels,
• inserts a character "." before each consonant,
• replaces all uppercase consonants with corresponding lowercase ones.

Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string.

Help Petya cope with this easy task.

Input

The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.

Output

Print the resulting string. It is guaranteed that this string is not empty.

Examples

input

tour

output

.t.r

input

Codeforces

output

.c.d.f.r.c.s

input

aBAcAba

output

.b.c.b

输入小于100个字母（不分大小写），含aeiouy（含大写）的字母去掉，其他字母输出时在前面加个.，下面为代码：

#import<bits/stdc++.h>
main(char s)
{
while(std::cin>>s)//  输入字符串
if(!strchr("AEIOUYaeiouy",s))
cout<<'.'<<(char)tolower(s);  //tolower 函数 把ascii码转换为字符
}