Thank you, IEEE 754! - 2

There is an array $A$ of length $1001$, indexed from $0$ through $1000$.

You must construct one fixed sequence of operations using only the following four operation types.

• + i j: set $A_i \leftarrow A_i + A_j$.
• : set .

The input gives a task number $T$. If $1 \leq T \leq 5$, the checker independently tests all $256$ integers $x$ satisfying $0 \leq x < 256$. For each test, initially and every other element is . If , the checker tests all ordered pairs satisfying . In this case, initially , , and every other element is .

For every test, the same operation sequence that you print is executed once from beginning to end. At the end of the execution, $A_{1000}$ must have the following value.

Here, $[P]$ is $1$ when proposition $P$ is true and $0$ otherwise. The symbols $\mathbin{\&}$ and $\mathbin{|}$ denote bitwise AND and bitwise OR on integers, respectively.

Every value and operation result uses the IEEE 754 binary32 32-bit floating-point format. The rounding mode is round to nearest, ties to even. Operations are executed independently in the exact order printed, and the result is rounded to binary32 after every operation. Operations are not fused, reordered, or evaluated while keeping a higher-precision intermediate result.

For s and c, $M$ must be a finite decimal floating-point literal written as one token. A sign, decimal point, and decimal exponent notation may be used. Before use, $M$ is converted to binary32 under the rounding rule above. After every operation, the modified array element must remain finite.

Print one operation sequence that satisfies every case of the given task.

The input is given in the following format.

$T$

$T$ is the task number to solve.

On the first line, print the number of operations $K$.

On the next $K$ lines, print the operations in execution order, one per line. Each line must have one of the following four forms.

+ $i$ $j$ - $i$ $$

• $1 \leq T \leq 6$.
• For tasks $1$ through $5$, every integer $x$ tested by the checker satisfies $0\le x<256$.