#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>

using namespace std;

namespace MYS
{
  typedef long long LL;

  const int MAXN = 35;
  
  int N;
  int seq[MAXN];
  LL C[MAXN][MAXN];
  LL ans[2];

  void ready()
  {
    memset(C, 0, sizeof(C));
    C[0][0] = 1;
    for(int i=1;i<=30;i++)
      for(int j=0;j<=i;j++) {
    if(j == 0 || j == i) C[i][j] = 1;
    else C[i][j] = C[i-1][j-1] + C[i-1][j];
      }
  }
  
  void input()
  {
    scanf("%d", &N);
    for(int i=1;i<=N;i++) scanf("%d", seq+i);
    sort(seq+1, seq+N+1);
  }

  void work()
  {
    int last = 1;
    ans[0] = ans[1] = 0;
    seq[N+1] = seq[N] + 1;
    seq[0] = seq[1] - 1;
    for(int i=1;i<=N;i=last) {
      while(seq[last] == seq[i]) last++;
      for(int j=0;j<=N-i;j++)
    ans[(j+i)&1] += seq[i] * C[N-i][j];
    }

    if(ans[0] > ans[1]) swap(ans[0], ans[1]);
    cout<<ans[1] - ans[0]<<endl;
  }

  void Main()
  {
    int T;
    scanf("%d", &T);
    ready();
    while(T--) {
      input();
      work();
    }
  }
}


int main()
{
  //freopen("in.txt", "r", stdin);
  MYS::Main();
  return 0;
}