25268번 - Name Generation 스페셜 저지다국어

문제

Ingrid is the founder and CEO of bicycle retailer BIKEA. The company sells bicycles for customers to assemble themselves.

BIKEA has $N$ different bicycles to offer. Ingrid wants to give each of them a human-readable name, to make it easy to remember. But doing this by hand is a very time consuming task.

You are given the number $N,ドル and your task is to generate $N$ different names. To make the names readable, they must satisfy the following:

1. Each name has length between 3ドル$ and 20ドル,ドル and only consists of lowercase English letters.
2. Three consecutive letters of a name cannot all be vowels or consonants. Here we consider a, e, i, o, u vowels, while the remaining 21ドル$ letters are consonants.

For example, hello, abc, and lkab are all valid names, whereas ingrid, bo and louise are invalid.

입력

The input consists of one integer $N$ (1ドル \leq N \leq 30000$), the number of names to generate.

출력

Print $N$ lines, each of them containing a name. It can be proven that it is possible to generate $N$ different names.

제한

힌트