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^5) — 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.

Difficulty: interview

Starter code:

Solutions:
n = int(input())
s = "aabb" * ((n+4)//4)
s = s[:n]
print(s)

n = int(input())
for i in range(n):
    if i % 4 < 2:
        print('a', end='')
    else:
        print('b', end='')

def __starting_point():
    s = ''
    n = int(input())
    while len(s) < n + 10:
        s += 'aabb'
    print(s[:n])

__starting_point()

n = int(input())
print("aabb"*(n//4)+"aabb"[:n%4])

n = int(input())
ans = ''
for i in range(n // 4):
    ans += 'aabb'

if n % 4 == 1:
    ans += 'a'

if n % 4 == 2:
    ans += 'aa'
    
if n % 4 == 3:
    ans += 'aab'
    
print(ans)

s = "aabb" * 200005
n = int(input())
print(s[:n])


n = int(input())

print(('aabb' * (n // 4 + 4))[:n])


n = int(input())
s = 'aabb'
s = s * (n // 4) + s
print(s[0:n])


n=int(input())
c=n // 4
if n%4 == 1:
    print('aabb' * c,'a',sep='')
if n%4 == 2:
    print('aabb' * c,'aa',sep='')
if n%4 == 3:
    print('aabb' * c,'aab',sep='')
if n%4 == 0:
    print('aabb' * c)
    



import math


def main():
	n = int(input())
	ans = ""
	for i in range(n):
		if i%4 == 0 or i % 4 == 1:
			ans += "a"
		else :
			ans += "b"
	print(ans)
main()


s = 'aabb' * 10**5
n = int(input())
print(s[:n])


n = int(input())
s = 'aabb' * (10 ** 5)
print(s[:n])

n = int(input())

ans = "aabb" * ((n+3)//4)
print(ans[:n])

n = input()
n = int(n)
for i in range(n):
    if (i//2)%2 == 0:
        print('a', end="")
    else:
        print('b', end="")

n = int(input())
s = ""
def getch(i):
    if i%4 == 0 or i%4 == 1:
        return 'a'
    else:
        return 'b'
for i in range(n):
    s+=getch(i)
print(s)

n = int(input())
ans = ["a","a","b","b"]*n
print("".join(ans[:n]))


import math,string,itertools,collections,re,fractions,array,copy
import bisect
import heapq
from itertools import chain, dropwhile, permutations, combinations
from collections import deque, defaultdict, OrderedDict, namedtuple, Counter, ChainMap


# Guide:
#   1. construct complex data types while reading (e.g. graph adj list)
#   2. avoid any non-necessary time/memory usage
#   3. avoid templates and write more from scratch
#   4. switch to "flat" implementations

def VI(): return list(map(int,input().split()))
def I(): return int(input())
def LIST(n,m=None): return [0]*n if m is None else [[0]*m for i in range(n)]
def ELIST(n): return [[] for i in range(n)]
def MI(n=None,m=None): # input matrix of integers
    if n is None: n,m = VI()
    arr = LIST(n)
    for i in range(n): arr[i] = VI()
    return arr
def MS(n=None,m=None): # input matrix of strings
    if n is None: n,m = VI()
    arr = LIST(n)
    for i in range(n): arr[i] = input()
    return arr
def MIT(n=None,m=None): # input transposed matrix/array of integers
    if n is None: n,m = VI()
    a = MI(n,m)
    arr = LIST(m,n)
    for i,l in enumerate(a):
        for j,x in enumerate(l):
            arr[j][i] = x
    return arr

def main(info=0):
    n = I()
    if n<=2:
        print("aa"[:n])
        return
    s = []
    for i in range(n):
        if i%4==0 or i%4==1:
            s.append("a")
        else:
            s.append("b")
    print("".join(s))


def __starting_point():
    main()

__starting_point()

import sys

fin = sys.stdin
fout = sys.stdout
n = int(fin.readline())
m = ['a', 'b']
s = ''
for i in range(n):
    s += m[(i // 2) % 2]
fout.write(s)

n = int(input())
currs = 0
while(n >1):
    n-=2
    if(currs == 0):
        print("aa", end ="")
        currs = 1
    else:
        print("bb", end = "")
        currs = 0
if(n == 1):
    if(currs == 0):
        print("a", end ="")
    else:
        print("b", end ="")

n=int(input())
s=''
abc='abc'
for i in range(n):
   if i<2:
       s+='a'
   else:
       for j in abc:
           if ((s[i-2]+s[i-1]+j)!=(j+s[i-1]+s[i-2])):
               s+=j
               break
print(s)


n = int(input())
someStr = 'aabb'
resultStr = someStr*(n//4)+someStr[0:n%4:]
print(resultStr)