C - Fake bullions （思维）

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.

题意：

就是找字符串中没有长度为3的回文串而且只有abc三个字母，使c字母最少，然后输出一种可能结果

思路：

只需要aabb即可，有多长取多长，特别注意，只是长度为3，超过三或者低于三均可以

代码：

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main()
{
	int n, i;
	while (cin >> n)
	{
		for (i = 0; i <= n - 4; i += 4)
		{
			cout << "aabb";
		}
		int x = n - i;
		if (x == 1)
			cout << "a";
		else if (x == 2)
			cout << "aa";
		else if (x == 3)
			cout << "aab";
		cout << endl;
	}
	return 0;
}