Compress a lowercase string by scanning it left to right and replacing every maximal run of the same character with that character followed by the length of the run.
For example the runs of aaab are aaa and b, producing a3b1. The count is always written, even when it is 1.
Input format
One line: a non-empty lowercase string s.
Output format
One line: the run-length compressed string.
Constraints
- 1 <= len(s) <= 100000
sconsists of lowercase English letters.