Problem J. Jump or increment? ≡

Statement

Young programmer Vasya decided to learn microprocessor design. As a first step, he designed a processor with a single integer register with initial value 0, and two instructions:

• Increment register value by 1 (denoted by letter i).
• Jump back to the beginning of a program (denoted by letter j).

Vasya's friend Petya suggested to modify a design so that after executing jump instruction processor would replace it with a special 'no-op' instruction which does nothing.

Now, Vasya's microprocessor could do something at least a little bit interesting. Vasya wants to explore low-level optimization for his new microprocessor.

Your program must output a shortest non-empty program for Vasya's microprocessor which would put a given value into the register.

Input file format

Input file contains a single integer N — expected value in the register.

Output file format

Output file must contain a single string consisting of letters i and j — a shortest program to put an expected value into the register.

If there are several shortest programs, output any of them.

Constraints

0 ≤ N ≤ 10⁹.

Sample tests

0

j

1

i

17

ijiiijjj