C. Repetition
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Print a string $$$s$$$ such that there exactly $$$n$$$ palindromic substrings in $$$s$$$.

A palindromic substring $$$p$$$ is a substring in $$$s$$$ such that it is a palindrome. For example, $$$aba$$$ has exactly 4 palindromic substrings: $$$a$$$, $$$b$$$, $$$a$$$, $$$aba$$$.

Input

The input consists of one integer $$$n$$$ $$$(1 \le n \le 1000)$$$.

Output

Output a valid string $$$s$$$ $$$(1 \le |s| \le n)$$$.

Example
Input
4
Output
aba