#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e5 + 10;

int a[maxn]; 

int main()
{
	int t; 
	cin >> t; 
	while (t--)
	{
		int n , p = 1 ; 
		cin >> n;  
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i]; 
		}
		for (int i = 2; i <= n; i++)
		{
			if (a[i] < a[p]) p = i; 
		}

		cout << n - 1 << endl; 
		for (int i = 1; i <= n; i++)
		{
			if (i == p) continue; 
			if (abs(i - p) % 2 == 0)
				cout << i << " " << p << " " << a[p] << " " << a[p] << endl;
			else cout << i << " " << p << " " << a[p] + 1 << " " << a[p] << endl; 
		}
		
	}
	return 0;
}