In this problem, your program will run simultaneously in a total of $2 \cdot n_{Instance}$ processes, with each process handling $T$ independent test cases. Specifically, for each $1 \leq i \leq n_{Instance}$, the $(2i-1)$-th process will handle $T$ encoding tasks, and the $2i$-th process will handle $T$ decoding tasks. Note that the order of calls for encoding and decoding, both between processes and within each process, is arbitrary.

In each process, the time consumed must not exceed $0.005 \cdot T$ seconds, and the memory usage must not exceed 8 MiB.

Depending on the test case, $1 \leq n_{Instance} \leq 4$ and $50 \leq T \leq 999$.