Count and Say Sequence

The **count-and-say** sequence is a sequence of digit strings defined by the recursive formula: - `countAndSay(1) = "1"` - `countAndSay(n)` is the run-length encoding of `countAndSay(n - 1)`. Run-length encoding (RLE) is a string compression method where consecutive identical characters are replaced by the concatenation of the character count and the character. Given a positive integer `n`, return the `n-th` term of the count-and-say sequence. ### Constraints - `1 <= n <= 30` ### Input Format A single line containing the integer `n`. ### Output Format Print the `n-th` count-and-say digit string.