Special Subarrays
[2] You are given an array NAME_1 of size N consisting of non-negative integers. Find the number of subarrays of NAME_1, which are Special.

A subarray is called Special if it satisfies the following condition:

® The product of the maximum element and the minimum element of the subarray is
divisible by the length of the subarray.

Find the number of Special subarrays of the array NAME_1.
Input format :

1)The first line contains 7, which represents the number of test cases.

2)For each test case:
	a)The first line consists of a single integer N, denoting the size of the array NAME_1.

	b)The next line contains N space-separated integers, denoting the elements of NAME_1.
Output format : For each test case, print the answer in a new line