CF805B.3-palindrome

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $n$ he wants to obtain a string of $n$ characters, each of which is either 'a', 'b' or 'c', with no palindromes of length $3$ 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.

输入格式

The first line contains single integer $n$ ( $1<=n<=2·10^{5}$ ) — the length of the string.

输出格式

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

输入输出样例

输入#1
```
2
```
输出#1
```
aa
```
输入#2
```
3
```
输出#2
```
bba
```

说明/提示

A palindrome is a sequence of characters which reads the same backward and forward.

首页