#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const long long N = (long long)(2 * 1e5 + 10);
long long dp[100004];
long long n;
long long a[100004];
long long func(long long ind) {
  if (ind > n) return 0;
  if (dp[ind] != -1) return dp[ind];
  long long count = 0;
  for (long long i = ind; i <= n; i += ind) {
    if (a[i] > a[ind]) count = max(count, 1 + func(i));
  }
  return dp[ind] = count;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  cin >> T;
  while (T--) {
    cin >> n;
    for (long long i = 1; i <= n; i++) {
      cin >> a[i];
      dp[i] = -1;
    }
    long long maxi = 1;
    for (long long i = 1; i <= n; i++) {
      maxi = max(maxi, 1 + func(i));
    }
    prl(maxi);
  }
}
