A. Favorite Phrase
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

As per tradition, we are collecting your favorite phrases!

However, this time, there are some rules. Christian particularly likes phrases that have exactly $$$n$$$ space-free substrings — substrings that don't contain the space character. For example, the phrase "$$$\mathrm{Hey \; yo}$$$" has $$$9$$$ space-free substrings: $$$\mathrm{Hey}$$$, $$$\mathrm{He}$$$, $$$\mathrm{ey}$$$, $$$\mathrm{H}$$$, $$$\mathrm{e}$$$, $$$\mathrm{y}$$$, as well as $$$\mathrm{yo}$$$, $$$\mathrm{y}$$$, and $$$\mathrm{o}$$$.

If one space-free substring appears multiple times, it is counted that many times. In other words, we count the total number of space-free substrings, not the number of unique space-free subtrings.

Given a positive integer $$$n$$$, output a phrase with exactly $$$n$$$ space-free substrings.

Input

The input contains a single integer $$$n$$$ ($$$1 \leq n \leq 100$$$) — the number of space-free substrings in your phrase.

Output

Output a phrase with exactly $$$n$$$ space-free substrings on one line. You may use lowercase and uppercase English letters and spaces. Your phrase may have at most 10 words. The words in your phrase don't have to be actual English words.

Examples
Input
9
Output
Hey yo
Input
21
Output
Proof by AC