/************************************************

* Author        :Running_Time

* Created Time  :2015-8-24 13:21:56

* File Name     :B_2.cpp

 ************************************************/

#include <cstdio>

#include <algorithm>

#include <iostream>

#include <sstream>

#include <cstring>

#include <cmath>

#include <string>

#include <vector>

#include <queue>

#include <deque>

#include <stack>

#include <list>

#include <map>

#include <set>

#include <bitset>

#include <cstdlib>

#include <ctime>

using namespace std;

#define lson l, mid, rt << 1

#define rson mid + 1, r, rt << 1 | 1

typedef long long ll;

const int N = 1e5 + 10;

const int INF = 0x3f3f3f3f;

const ll INFF = 1ll << 62;

const int MOD = 1e9 + 7;

struct Point	{

	ll x, y, sum;

}p[N];

int n;

bool cmpx(Point a, Point b)	{

	return a.x < b.x;

}

bool cmpy(Point a, Point b)	{

	return a.y < b.y;

}

int main(void)    {

	int T;	scanf ("%d", &T);

	while (T--)	{

		scanf ("%d", &n);

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

			scanf ("%I64d%I64d", &p[i].x, &p[i].y);

		}

		sort (p+1, p+1+n, cmpx);	ll sum = 0;

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

			p[i].sum = (i - 1) * p[i].x - sum;

			sum += p[i].x;

		}

		sum = 0;

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

			p[i].sum += sum - (n - i) * p[i].x;

			sum += p[i].x;

		}

		sort (p+1, p+1+n, cmpy);	sum = 0;

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

			p[i].sum += (i - 1) * p[i].y - sum;

			sum += p[i].y;

		}

		sum = 0;

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

			p[i].sum += sum - (n - i) * p[i].y;

			sum += p[i].y;

		}

		ll ans = INFF;

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

			ans = min (ans, p[i].sum);

		}

		printf ("%I64d\n", ans);

	}

    return 0;

}