Thank you, IEEE 754! - 1

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$.
• - i j: set $A_i \leftarrow A_i - A_j$.
• s i M: convert the constant $M$ to a 32-bit floating-point value, then set $A_i \leftarrow M$.
• c i M: convert the constant $M$ to a 32-bit floating-point value, then set $A_i \leftarrow M \times A_i$.

The checker independently tests all $63$ integers $N$ satisfying $-31 \leq N \leq 31$. For each test, initially $A_0=N$, and $A_1,A_2,\cdots,A_{1000}$ are all $0$. The same operation sequence that you print is then executed once from beginning to end.

At the end of the execution for each $N$, $A_{1000}$ must satisfy

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 all $63$ cases.

The input is given in the following format.

$0$

The input value is always $0$ and may be ignored when constructing the operation sequence. The actual verification over all $63$ values of $N$ is performed internally by the checker as described in the statement.

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$ $j$ s $i$ $M$ c $i$ $M$

You must have $0 \leq K \leq 2000$. Every index must be between $0$ and $1000$, inclusive. The token for $M$ must contain at most $64$ characters and must be a finite decimal floating-point literal as defined in the statement.

If there are multiple valid answers, print any of them.

• Every integer $N$ tested by the checker satisfies $-31 \leq N \leq 31$.
• Array indices range from $0$ through $1000$.
• The number of printed operations satisfies $0 \leq K \leq 2000$.
• Every calculation follows IEEE 754 binary32 with round to nearest, ties to even.