Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Lord of the Values

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputWhile trading on his favorite exchange trader William realized that he found a vulnerability. Using this vulnerability he could change the values of certain internal variables to his advantage. To play around he decided to change the values of all internal variables from $$$a_1, a_2, \ldots, a_n$$$ to $$$-a_1, -a_2, \ldots, -a_n$$$. For some unknown reason, the number of service variables is always an even number.

William understands that with his every action he attracts more and more attention from the exchange's security team, so the number of his actions must not exceed $$$5\,000$$$ and after every operation no variable can have an absolute value greater than $$$10^{18}$$$. William can perform actions of two types for two chosen variables with indices $$$i$$$ and $$$j$$$, where $$$i < j$$$:

- Perform assignment $$$a_i = a_i + a_j$$$
- Perform assignment $$$a_j = a_j - a_i$$$

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 20$$$). Description of the test cases follows.

The first line of each test case contains a single even integer $$$n$$$ ($$$2 \le n \le 10^3$$$), which is the number of internal variables.

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ $$$(1 \le a_i \le 10^9)$$$, which are initial values of internal variables.

Output

For each test case print the answer in the following format:

The first line of output must contain the total number of actions $$$k$$$, which the strategy will perform. Note that you do not have to minimize $$$k$$$. The inequality $$$k \le 5\,000$$$ must be satisfied.

Each of the next $$$k$$$ lines must contain actions formatted as "type i j", where "type" is equal to "1" if the strategy needs to perform an assignment of the first type and "2" if the strategy needs to perform an assignment of the second type. Note that $$$i < j$$$ should hold.

We can show that an answer always exists.

Example

Input

2 4 1 1 1 1 4 4 3 1 2

Output

8 2 1 2 2 1 2 2 1 3 2 1 3 2 1 4 2 1 4 1 1 2 1 1 2 8 2 1 4 1 2 4 1 2 4 1 2 4 1 3 4 1 1 2 1 1 2 1 1 4

Note

For the first sample test case one possible sequence of operations is as follows:

- "2 1 2". Values of variables after performing the operation: [1, 0, 1, 1]
- "2 1 2". Values of variables after performing the operation: [1, -1, 1, 1]
- "2 1 3". Values of variables after performing the operation: [1, -1, 0, 1]
- "2 1 3". Values of variables after performing the operation: [1, -1, -1, 1]
- "2 1 4". Values of variables after performing the operation: [1, -1, -1, 0]
- "2 1 4". Values of variables after performing the operation: [1, -1, -1, -1]
- "1 1 2". Values of variables after performing the operation: [0, -1, -1, -1]
- "1 1 2". Values of variables after performing the operation: [-1, -1, -1, -1]

For the second sample test case one possible sequence of operations is as follows:

- "2 1 4". Values of variables after performing the operation: [4, 3, 1, -2]
- "1 2 4". Values of variables after performing the operation: [4, 1, 1, -2]
- "1 2 4". Values of variables after performing the operation: [4, -1, 1, -2]
- "1 2 4". Values of variables after performing the operation: [4, -3, 1, -2]
- "1 3 4". Values of variables after performing the operation: [4, -3, -1, -2]
- "1 1 2". Values of variables after performing the operation: [1, -3, -1, -2]
- "1 1 2". Values of variables after performing the operation: [-2, -3, -1, -2]
- "1 1 4". Values of variables after performing the operation: [-4, -3, -1, -2]

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2021 17:42:14 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|