|Input file:||input.txt||Time limit:||1 sec|
|Output file:||output.txt||Memory limit:||256 Mb|
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:
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 contains a single integer N — expected value in the register.
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.
0 ≤ N ≤ 109.
|No.||Input file (
||Output file (|