Deep in the quays of Driftwood, Sable studies rows of charms entries. One clean number will settle the guild's oldest argument. Task: Compress s using run-length encoding: replace each maximal run of equal characters c repeated k times by c followed by k. Input format: One line with a single lowercase string s. Output format: Print the encoded string. Constraints: 1 <= |s| <= 1074; s contains lowercase English letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s| <= 1074; s contains lowercase English letters.
