// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
using namespace std;
// mylittledoge

struct info {
	double d;
	int c[2];

	bool operator<(const info &I) const {
		return d < I.d;}
	};

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	int N;
	cin >> N;
	vector<info> A(N*(N-1)/2);
	int x =0;
	for(int i =0; i < N; i++) for(int j =0; j < N; j++) {
		double d;
		cin >> d;
		if(j > i) A[x++].d =d;}
	x =0;
	for(int i =0; i < N; i++) for(int j =0; j < N; j++) {
		int c;
		cin >> c;
		if(j > i) A[x++].c[1] =c;}
	x =0;
	for(int i =0; i < N; i++) for(int j =0; j < N; j++) {
		int c;
		cin >> c;
		if(j > i) A[x++].c[0] =c;}
	sort(A.begin(),A.end());
	N =A.size();

	cout << N/2 << " ";
	vector< vector<int> > C[2];
	for(int i =0; i < 2; i++) C[i].resize(N+1,vector<int>(N+tisic,OVER9000));
	C[0][0][0] =0;
	for(int i =0; i < N; i++) for(int j =0; j <= N; j++) {
		for(int k =0; k < 2; k++) {
			if(j > 0) C[k][i+1][j-1] =min(C[k][i+1][j-1],C[k][i][j]+A[i].c[1]);
			C[k][i+1][j+1] =min(C[k][i+1][j+1],C[k][i][j]+A[i].c[0]);}
		C[1][i+1][j] =min(C[1][i+1][j],C[0][i][j]);}

	cout << C[N%2][N][0] << "\n";
	return 0;}

// look at my code
// my code is amazing