Unpacking a line#822
We will consider only strings consisting of uppercase Latin letters. For example, consider the string AAAABCCCCCDDDD. The length of this string is . Since the string contains only Latin letters, consecutive repeated characters can be removed and replaced by a number indicating the count of repetitions. Thus, the string can be represented as 4AB5C4D. The length of this new string is . This process is called compression of the string.
Write a program that takes a compressed string and reconstructs the original string from it.
The input contains one compressed string. The string may contain only constructions of the form nA, where is the number of repetitions of the character (an integer from to ), and is an uppercase Latin letter, or constructions of the form A, that is, a letter without a number indicating the number of repetitions. The maximum length of the string does not exceed .
Print the reconstructed string. The string should be divided into lines containing exactly characters each (except for the last line, which may contain fewer than characters).
Example 1
Example 2