第五场 F - 3-palindrome

B. 3-palindrome

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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·105) — the length of the string.

Output

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

Examples

input

Copy

2

output

aa

input

Copy

3

output

bba

Note

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

题意：输出指定长度的字符串的其中一种情况，字符串中相邻三个字符不能是回文字符串，字符串中只能含有a，b，c三种字符，并且还要保证整个字符串中含有的c最少。

思路：每三个字母中都要有两个相邻且相同的字符，并且整个字符串中字符的排列都得如此。例如aabbaabb……或bbaabbaa……，确保c最少，即C不存最。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        if(i%4==1||i%4==2)
            printf("b");
        else
            printf("a");
    }
    printf("\n");
    return 0;
}