CF#805 B. 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

2

output

aa

input

3

output

bba

Note

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

题意：用 a ，b ，c 三个字符构造一个长度为 n 的字符串，使其任意一个长度为 3 的字串都不是回文串，并使 c 出现的次数尽量少。

#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;
char a[N];
int n;

int main()
{
    while(scanf("%d", &n) == 1)
    {
        memset(a, 0, sizeof(a));
        int flag = 0;
        for(int i = 0; i < n; i += 2)
        {
            if(flag)
            {
                a[i] = 'b', flag = 0;
                if(i + 1 < n) a[i + 1] = 'b';
            }
            else
            {
                a[i] = 'a', flag = 1;
                if(i + 1 < n) a[i + 1] = 'a';
            }
        }
        printf("%s\n", a);
    }
}