#include<iostream>

 #include<algorithm>

 #include<string>

 #include<cstring>

 using namespace std;

 const int maxn =  + ;

 const int INF = ;

 int n;

 int x[maxn], y[maxn];

 double d[maxn][maxn];

 //行列式求三角形面积

 double area(int a, int b, int c)

 {

     double s = (double)(1.0 / )*(x[a] * y[b] + x[b] * y[c] + x[c] * y[a] - x[a] * y[c] - x[b] * y[a] - x[c] * y[b]);

     if (s<) return -s;

     return s;

 }

 //判断三角形内部是否有点

 bool check(int a, int b, int c)

 {

     int i;

     for (i = ; i <= n; i++)

     {

         if (i == a || i == b || i == c) continue;

         double d = area(a, b, i) + area(a, c, i) + area(b, c, i) - area(a, b, c);

         if (d<) d = -d;

         if (d <= 0.01) return ;

     }

     return ;

 }

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int T;

     cin >> T;

     while (T--)

     {

         cin >> n;

         for (int i = ; i <= n; i++)

             cin >> x[i] >> y[i];

         for (int i = n; i >= ; i--)

         {

             d[i][i+] = ;

             for (int j = i + ; j <= n; j++)

             {

                 d[i][j] = INF;

                 for (int k = i + ; k < j; k++)

                 {

                     if (check(i, j, k))

                         d[i][j] = min(d[i][j], max(max(area(i, j, k), d[i][k]), d[k][j]));

                 }

             }

         }

         printf("%.1lf\n", d[][n]);

     }

     return ;

 }