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.
#from __future__ import division
import itertools
from fractions import gcd
from math import sqrt
from bisect import bisect_left , bisect_right
import heapq
from collections import deque , defaultdict , Counter
from itertools import combinations as C
def Ls():
	return list(raw_input())
def get(a):
	return map(a , raw_input().split())
def Int():
	return int(raw_input())
def Str():
	return raw_input()

# May god bless me today , not with good rank but with satisfaction
# if you hacking , please wish me luck

n = input()
st = ''
ls = [0]*(2*n)
ix = 0
for i in xrange(n):
	if i % 2 == 0:
		ls[ix] = 'a'
		ix += 1
		ls[ix] = 'b'
		ix += 1
	else:
		ls[ix] = 'b'
		ix += 1
		ls[ix] = 'a'
		ix += 1
print ''.join(ls[:n])

		
		
	



		
