Sarima is playing her favourite computer game, Legends of the League. Today she wants to practice combos of different lengths.

A combo is a string only containing the letters a, b, and c that contains no palindromes of length $3$ as substrings. For example, abcabc and bca are combos, while aaba is not. Also, because she wants to practice easier combos, the number of letters c in the string has to be as small as possible.

A palindrome is a string that reads the same backward as forward. For example strings a, aaa, aba, and abccba are palindromes, while strings abc, aab, and ab are not.

Input

The first line contains a single integer $n$ ($1 \le n \le 10^5$) – the length of the string.

Output

Print a string that satisfies the constraints.

If there are multiple solutions, you may output any of them.

Example 1

stdin

1

stdout

a

Example 2

stdin

2

stdout

aa