#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
struct sesi
{
private:
protected:
public:
long long a;
long long b;
long long hap;
};
bool cmp(sesi a,sesi b)
{
return a.hap > b.hap;
}
int main()
{
sesi s[10000];
long long n,t;
long long i,j,test_case;
long long a_sum,b_sum;
scanf("%lld",&t);
for(test_case=1;test_case<=t;test_case++)
{
a_sum = 0;
b_sum = 0;
scanf("%lld",&n);
for(i = 0;i < n;i++)
{
scanf("%lld %lld",&s[i].a,&s[i].b);
s[i].hap = s[i].a+s[i].b;
}
sort(s,s+n,cmp);
s[n].hap = 0;
s[n].b = 0;
for(i = 0; i < n;)
{
a_sum += s[i].a;
i++;
b_sum += s[i].b;
i++;
}
printf("#%lld %lld\n",test_case,a_sum-b_sum);
}
}