**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Count and Say** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
RLE: group same chars and prefix count
**Edge Cases to Consider:**
- (1) n = 1
- (2) Long runs of same digit
- (3) n is large