A warehouse printer stores each shelf label in run-length form to save ink. Given a label consisting of lowercase English letters, encode it by scanning left to right and replacing every maximal run of one repeated character with that character immediately followed by the decimal length of the run. The length is always written out, even when it is 1.
For instance, a run of four as becomes a4, and a lone b becomes b1.
Input format
Line 1: a non-empty string of lowercase English letters.
Output format
A single line: the run-length encoding, formed by concatenating <character><run length> for each run in order.
Constraints
- 1 <= length of the string <= 100000
- The string consists only of lowercase English letters (
a-z).