P8706 [Lanqiao Cup 2020 NOI Qualifier AB1] Decode

Xiaoming has a very long string of English letters, which may contain both uppercase and lowercase letters. In this string, many consecutive letters are repeated. Xiaoming came up with a way to write this string shorter: write several consecutive identical letters in the form of the letter + the number of times it appears. For example, for $5$ consecutive `a`'s, i.e. `aaaaa`, Xiaoming can abbreviate it as `a5` (it can also be abbreviated as `a4a`, `aa3a`, etc.). For this example: `HHHellllloo`, Xiaoming can abbreviate it as `H3el5o2`. To make it easier to express, Xiaoming will not abbreviate any run of more than 9 identical characters. Now you are given the abbreviated string. Please help Xiaoming restore the original string.

Input one line containing a string.

Output one string, representing the restored original string.

For all testdata, the string consists of uppercase and lowercase English letters and digits, and its length does not exceed $100$. Note that the length of the original string may exceed $100$. Lanqiao Cup 2020 First Round Provincial Contest, Group A Problem F (Group B Problem G). Translated by ChatGPT 5