做题的方式简单点

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.

Input

The first line contains single integer n (1 ≤ n ≤ 2·10⁵) — the length of the string.

Output

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

Example

Input

2

Output

aa

Input

3

Output

bba

Note

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

题意：

打印一个长度为n的只含有a,b,c（尽量含有最少的c）的字符串，

其中相连的3个字符不能形成回文字符串

代码：

#include
#include
#include
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	if(n<=3){
		for(int i=0;i

经过上述代码，找到规律

代码：

#include
int main(){
	char s[]="aabb";
	int n;
	scanf("%d",&n);
	int i;
	for(i=0;i