
int sum(int n);
int a[100][100];
int main()
{
	int n;
	cin >> n;
	int i = 0, j = 0, k = 0;
	for (k = 1; k <= n; k++)
	{
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				cin >> a[i][j];
			cout << sum(n) << endl;
	}
	return 0;
}

int sum(int n)
{
	int i = 0, j = 0;
	for (i = 0; i < n; i++)
	{
		int min = a[i][0];
		for (j = 0; j < n; j++)
			if (a[i][j] < min)
				min = a[i][j];
			for (j = 0; j < n; j++)
				a[i][j] -= min;
	}
	for (i = 0; i < n; i++)
	{
		int min = a[0][i];
		for (j = 0; j < n; j++)
			if (a[j][i] < min)
				min = a[j][i];
			for (j = 0; j < n; j++)
				a[j][i] -= min;
	}
	
	if (n == 2)
		return a[1][1];
	int k = a[1][1];
	for (i = 1; i < n - 1; i++)
	{
		a[0][i] = a[0][i + 1];
		a[i][0] = a[i + 1][0];
		for (j = 1; j < n - 1; j++)
			a[i][j] = a[i + 1][j + 1];
	}
	return k + sum(n - 1);
}