//Author: Puremg
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC optimize(3,"Ofast")
#include <bits/stdc++.h>
#define deg(a) cout<<#a<<'='<<a<<"\n"
#define int long long
#define all(a) a.begin(), a.end()
#define db double
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 2e5+10;
const db eps = 1e-10;
mt19937_64 rng(random_device{}());
int sgn(db x) {
  if (fabs(x) < eps) return 0;
  else if (x > 0) return 1;
  else return -1;
}
struct P {
  db x, y;
  P(){}
  P(db x, db y):x(x), y(y){}
  bool operator < (const P &tmp) const{return (x==tmp.x ? y<tmp.y : x<tmp.x);}
  P operator - (const P &tmp) const{return P(x - tmp.x, y - tmp.y);}
  int sign() const {
    if (y < 0 or (x > 0 and y == 0)) return 0;
    return 1;
  }
  int cross(const P &p) const {return x*p.y - y*p.x;}
};
int cross(P a, P b, P c) {
  P ab = b - a;
  P bc = c - b;
  return ab.x*bc.y-ab.y*bc.x;
}
db dis(P a, P b) {
  return sqrtl((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int dot(P a, P b, P c) {
  P ab = b - a;
  P bc = c - b;
  return ab.x*bc.x+ab.y*bc.y;
}
int dot(P a, P b, P c, P d) {
  P ab = b - a;
  P cd = d - c;
  return ab.x*cd.x+ab.y*cd.y;
}
void solve() {
  int n;
  cin >> n;
  vector<int> f(n * 2 + 10);
  vector<int> ok;
  for (int i = 1; i <= n; i ++) {
    cin >> f[i];
    ok.push_back(f[i]);
    f[i + n] = f[i];
  }
  sort(all(ok));
  ok.erase(unique(all(ok)), ok.end());
  for (int i = 1; i <= n * 2; i ++) {
    
    f[i] = lower_bound(all(ok), f[i]) - ok.begin() + 1;
  }
  vector<P> a(n * 2 + 10);
  for (int i = 1; i <= n; i ++) {
    cin >> a[i].x >> a[i].y;
    a[i + n] = a[i];
  }
  vector<vector<int>> lst(n * 2 + 10, vector<int>(2 * n + 10, 0));
  vector<vector<int>> nxt(n * 2 + 10, vector<int>(2 * n + 10, 2 * n + 1));
  for (int i = 1; i <= 2 * n; i ++) {
    lst[i] = lst[i - 1];
    lst[i][f[i]] = i;
  }
  for (int i = 2 * n; i >= 1; i --) {
    nxt[i] = nxt[i + 1];
    nxt[i][f[i]] = i;
  }
  vector<vector<int>> dp(n * 2 + 10, vector<int>(n * 2 + 10, -1));
  auto dfs = [&](auto dfs, int l, int r) -> int {
    if (dp[l][r] != -1) return dp[l][r];
    if (f[l] != f[r]) return dp[l][r] = 0;
    if (l + 1 >= r) return dp[l][r] = 0;
    int res = 0;
    for (int L = l + 1; L < r; L ++) {
      int R = lst[r - 1][f[L]];
      res = max(res, dfs(dfs, L, R) + abs(cross(a[L], a[l], a[r])) + abs(cross(a[L], a[R], a[r])));
    }
    for (int R = r - 1; R > l; R --) {
      int L = nxt[l + 1][f[R]];
      res = max(res, dfs(dfs, L, R) + abs(cross(a[L], a[l], a[r])) + abs(cross(a[L], a[R], a[r])));
    }
    return dp[l][r] = res;
  };
  int ans = 0;
  for (int l = 1; l <= 2 * n; l ++) {
    for (int r = l; r <= min(l + n - 1, 2 * n); r ++) {
      if (f[l] == f[r])
        ans = max(ans, dfs(dfs, l, r));
    }
  }
  cout << ans << '\n';
}
signed main()
{
 // auto start_time = std::chrono::high_resolution_clock::now();
 // freopen("in.txt", "r", stdin);
 // freopen("out.txt", "w", stdout);
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int T = 1;
  cin >> T;
  while (T--) solve();
  // auto end_time = std::chrono::high_resolution_clock::now();
  // auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time);
  // std::cout << "程序运行时间：" << duration.count() << "毫秒" << std::endl;
  return 0;
}