B. Kozak Vus və proqramlaşdırma

Kozak has a favorite robot named Atlas, which he played with a lot during his childhood. Recently, Vus realized he had never tried programming the robot for different tasks, so he started reading the manual. He discovered that Atlas has $40$ registers, each numbered starting from $1$, and each register contains $64$ bits. This means each register is made up of $64$ zeros and ones.

Vus learned that the robot can be programmed using seven specific commands that perform operations on these registers. For simplicity, we will refer to register $i$ as the register with the number $i$, and a_i as the number stored in the $i$-th register.

1. setValue($i$, $j$) — Replace the contents of register $i$ with those of register $j$. Each bit in register $i$ is replaced by the corresponding bit in register $j$, which is equivalent to performing the operation a_i = a_j.

2. setXor($i$, $j$, $k$) — Replace the contents of register $i$ with the bitwise XOR of registers $j$ and $k$. Each bit in register $i$ is replaced by the XOR of the corresponding bits in registers $j$ and $k$.

3. setAnd($i$, $j$, $k$) — Replace the contents of register $i$ with the bitwise AND of registers $j$ and $k$.

4. setOr($i$, $j$, $k$) — Replace the contents of register $i$ with the bitwise OR of registers $j$ and $k$.

5. shiftLeft($i$, $x$) — Shift all bits in register $i$ $x$ positions to the left. (See explanation below.)

6. shiftRight($i$, $x$) — Shift all bits in register $i$ $x$ positions to the right. (See explanation below.)

7. setNot($i$, $j$) — Replace the contents of register $i$ with the bitwise NOT of register $j$. Each bit in register $i$ is set to $1$ if the corresponding bit in register $j$ is $0$, and set to $0$ if the corresponding bit in register $j$ is $1$.

A bitwise XOR of two bits results in $0$ if they are the same, and $1$ if they are different.

A bitwise AND of two bits results in $1$ only if both bits are $1$, and $0$ otherwise.

A bitwise OR of two bits results in $1$ if at least one bit is $1$, and $0$ only if both bits are $0$.

A shift left by $x$ positions in a register means that each bit is moved to the left by $x$ positions: the value at position $i$ becomes the value at position i-x, filled with zeros if i-x is out of bounds. The same logic applies for a shift right, filling zeros from the left.

After reading the manual, Kozak Vus came up with six interesting tasks. He realized that to program the robot for a specific task, he only needs to input a sequence of commands that will solve the task. Suppose $t$ is the number of commands executed for a certain task.

Here are the tasks:

Subtask 1: (up to $6$ points) The number $x$ is stored in register $1$. All other registers are filled with zeros. Let the number $y$ be $1$ if $x$ is even, and $0$ if $x$ is odd. The task is to ensure that after executing the operations, the number $y$ is stored in register $2$.

Subtask 2: (up to $10$ points) The number $x$ is stored in register $1$, and the number $y$ is stored in register $2$. All other registers are filled with zeros. Let z = x + y. The task is to ensure that after executing the operations, the number $z$ is stored in register $3$. If the binary representation of $z$ requires more than $64$ bits, only the first $64$ bits should be stored in register $3$.

Subtask 3: (up to $13$ points) The number $x$ is stored in register $1$. Let $y$ be the number of $1$s in the binary representation of $x$. After executing the operations, $y$ should be stored in register $2$.

Subtask 4: (up to $23$ points) Two different numbers $x$ and $y$ are stored in registers $1$ and $2$, respectively. If x > y, then a = 0 and b = 1; if y > x, then b = 0 and a = 1. The task is to ensure that after executing the operations, the numbers $a$ and $b$ are stored in registers $3$ and $4$, respectively.

Subtask 5: (up to $18$ points) The number $x$ is stored in register $1$. Let $y$ be the number of $1$s in the binary representation of $x$. After executing the operations, the number 2^y - 1 should be stored in register $1$.

Subtask 6: (up to $30$ points) Let $a$ be an array containing $9$ distinct non-negative integers. For each $i$ from $1$ to $9$, the number a_i is stored in the $i$-th register. Let $b$ be the sorted (ascending) array from $a$. After executing the operations, for each $i$ from $1$ to $9$, the number b_i should be stored in the $i$-th register. The indices in arrays $a$ and $b$ are $1$-based.

If no initial value is specified for a register, it is filled with zeros at the start. All numbers are between $0$ and 2^{64} - 1.

Kozak Vus knows the number of commands needed to solve each task but does not know which commands to use, so he seeks your help. Your task is to find a sequence of commands that will solve each task for any possible input.

Note that you can execute no more than 10^5 commands. Exceeding this limit will result in $0$ points and a Wrong Answer verdict. Executing an incorrect request will result in $0$ points and a Runtime Error verdict. The result of your solution in each subtask will be the registers where the correct answers reside. Any numbers can be in all other registers.

void solve(int n)