def solve(n, a):
print((n//2)*6)
for i in range(0, n, 2):
for j in range(2):
print(1, i+1, i+2)
print(2, i+1, i+2)
print(1, i+1, i+2)
for t in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
solve(n, a)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
cout<<(n/2)*6<<endl;
for(int i=0;i<n;i++)
{
cout<<1<<" "<<i+1<<" "<<i+2<<endl;
cout<<2<<" "<<i+1<<" "<<i+2<<endl;
cout<<1<<" "<<i+1<<" "<<i+2<<endl;
cout<<2<<" "<<i+1<<" "<<i+2<<endl;
cout<<1<<" "<<i+1<<" "<<i+2<<endl;
cout<<2<<" "<<i+1<<" "<<i+2<<endl;
i+=1;
}
}
}1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |
Doctor's Secret | Back to School |
I am Easy | Teddy and Tweety |