a=int(input())
for i in range(a):
n=int(input())
z=list(map(int,input().split()))
ans=[]
last=[]
for i in range(len(z)):
if(z[i]%2==z[0]%2):
last.append(i)
ans=[]
for i in range(len(last)-2,-1,-1):
ans.append([last[i]+1,last[-1]+1])
z[0]=z[last[-1]]
for i in range(1,len(z)):
if(z[i]%2!=z[0]%2):
ans.append([1,i+1])
print(len(ans))
for i in range(len(ans)):
print(ans[i][0],ans[i][1])
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
if (n == 1) {
puts("0");
continue;
}
vector<pair<int, int> > ans;
ans.emplace_back(1, n);
if ((a[0] + a[n - 1]) & 1) {
a[n - 1] = a[0];
} else {
a[0] = a[n - 1];
}
int x = a[0];
for (int i = 1; i < n - 1; i++) {
if ((a[i] + x) & 1) {
ans.emplace_back(1, i + 1);
} else {
ans.emplace_back(i + 1, n);
}
}
printf("%d\n", ans.size());
for (auto pr : ans) {
printf("%d %d\n", pr.first, pr.second);
}
}
return 0;
}17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 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 |