#include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<ctime>
#include<cstdlib>
#include<map>
#define endl "\n"
using ll = long long;
using db = double;
const ll INF = 1e5 + 5;
int a[3][1001];
using namespace std;
void solve()
{
	int n;
	cin >> n;
	for (int i = 0; i <= n - 1; i++)
	{
		for (int j = 0; j <= 2; j++)
		{
			cin >> a[i][j];
		}
	}
	int sum = 0;
	int b[3] = { 0,0,0 };
	for (int i = n - 1; i >= 0; i--)
	{
		int ans=a[i][0]-b[0];
		int cnt = 0;
		for (int j = 1; j <= 2; j++)
		{
			if (a[i][j]-b[j] > ans)
			{
				ans = a[i][j]-b[j];
				cnt = j;
			}
		}
		sum = sum + ans;
		for (int j = 0; j <= 2; j++)
		{
			if (j == cnt) b[j]=0;
			b[j]=2*b[j]+1;
		}
	}
	cout << sum << endl;
}
int main()
{
	ios::sync_with_stdio(0), cin.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		solve();
		cout << '\n';
	}
	return 0;
}