#Q. JIXMPII5XHXEFF#`~^"
JIXMPII5XHXEFF#`~^"
该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。
Statement
In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.
He is too selfish, so for a given he wants to obtain a string of characters, each of which is either 'a', 'b' or 'c', with no palindromes of length appearing in the string as a substring. For example, the strings "abc" and "abca" suit him, while the string "aba" doesn't. He also want the number of letters 'c' in his string to be as little as possible.
Format
Input
The first line contains single integer ( ) — the length of the string.
Output
Print the string that satisfies all the constraints.
If there are multiple answers, print any of them.
Sample
2
aa
3
bba
ShanghaiTech ACM 炸鱼杯
- 状态
- 已结束
- 规则
- OI
- 题目
- 46
- 开始于
- 2024-12-10 23:00
- 结束于
- 2024-12-15 13:00
- 持续时间
- 110 小时
- 主持人
-
_Arahc_
- 参赛人数
- 112