subarray
Source: hackerearth
Difficulty: EASY

Here is your task. You are given an array and you have to find the maximum possible length of subarray  In that subarray a[i+1]%a[i]==0
Every element in subarray is divisible by its previous element
Your task is to find maximum length of subarray.

INPUT  first line conatin number of test cases T. Each test case contain number of element in array N.Next line contain elements of array.
OUTPUT print maximum length of subarray 
Constraints
1 ≤ T ≤ 100
1 ≤ N ≤ 1000000
1 ≤ a[i] ≤ 1000000

SAMPLE INPUT
1
6
5 3 10 12 25 20

SAMPLE OUTPUT
3

Explanation

Subarray of maximum length conatins 5 10 20