Since, Bhavik is very good at solving coding problems so his friend Anurag comes up with a problem. Anurag wanted to decompress the data that was sent by his girlfriend before he read it. So he turns to Bhavik for help.This time you need to perform run length decoding on a given string but with a little bit twist.You need to print the number of occurrences of each character as specified in the input string only if the count of the character modulo 2 is greater than 0 otherwise just print the same character along with its count .

Input

Input consists of multiple lines of strings s(only lowercase letters a-z), one string per line,  with |s| <= 100000 (read the input till EOF)

Output

For each input string, output a single line printing the run length decoding of the input string

Example

Input:
a4
a4b3

Output:
a4
a4bbb