AT_arc229_a [ARC229A] AtCoder Reverse Contest

For a string $ S $ consisting of uppercase English letters, let $ f(S) $ be the maximum number of times the following operation can be performed when it is repeated zero or more times. - Choose one occurrence of the substring `ARC` and replace it with `CRA`. For example, for $ S= $ `ARARC`, $ f(S)=2 $ (the operations `ARARC` $ \to $ `ARCRA` $ \to $ `CRARA` can be performed, and this is the maximum). You are given an integer $ X $ between $ 0 $ and $ 600 $ (inclusive). Find one string $ S $ consisting of uppercase English letters, of length between $ 1 $ and $ 100 $ (inclusive), satisfying $ f(S)=X $ . It can be proved that such a string always exists under the constraints.

The input is given from Standard Input in the following format: > $ X $

Output one string $ S $ consisting of uppercase English letters, of length between $ 1 $ and $ 100 $ (inclusive), satisfying $ f(S)=X $ . If there are multiple such strings $ S $ , any of them will be accepted.

### Sample Explanation 1 $ S= $ `ARARC` is a string of length $ 5 $ consisting of uppercase English letters, satisfying $ f(S)=2 $ . Thus, outputting `ARARC` will be accepted. Besides this, `ARCXXXARC`, for example, will also be accepted. ### Constraints - $ 0\le X\le 600 $ - The input value is an integer.