3-palindrome CodeForces - 805B (思维)

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.

Examples

Input

2

Output

aa

Input

3

Output

bba

Note

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

题意：给你一个整数N，让你输出一个字符串，只包括abc三个字符串，并且它的所有长度为3的子串不能使回文串，并且c字符要求尽可能的少。

思路：既然要求c字符出现的尽可能的少，那么设想下是否可以不用c字符来构造出这个字符串。

通过思考可以发现，仅用两个字符ab，可以通过连续两个相同的字符来构造出整个字符串

即aabb，aabbaa，aabba，aab，aabbaabb，这样的。并且一定符合条件。

我们只需要用代码实现出来就好了。

我的AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define gg(x) getInt(&x)
using namespace std;
typedef long long ll;
inline void getInt(int* p);
const int maxn=;
const int inf=0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/

int main()
{
    ll l,r;
    cin>>l>>r;
    if(l==r)
    {
        cout<<l<<endl;
    }else
    {
        if(r-l>=)
        {
            cout<<<<endl;
        }else
        {
            cout<<l<<endl;
        }
    }
    return ;
}

inline void getInt(int* p) {
    char ch;
    do {
        ch = getchar();
    } while (ch == ' ' || ch == '\n');
    if (ch == '-') {
        *p = -(getchar() - '');
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  - ch + '';
        }
    }
    else {
        *p = ch - '';
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  + ch - '';
        }
    }
}