// Codeforces Beta Round #62 C. Synchrophasotron

#include <iostream>
#include <string>

using namespace std;

int f, e;
int n;
int l[6][6];
int h[6][6];
int a[6][6];
int in[6], out[6];

void search(int s, int d, int sum){
	if(s==n-1){
		if(f > out[0]){
			f = out[0];
			e = sum;
		} else {
			e = max(e, sum);
		}
		return;
	}
	if(d==n){
		if(s!=0&&in[s]!=out[s]) return ;
		search(s+1, s+2, sum);
		return;
	}
	for(int i=l[s][d];i<=h[s][d];i++){
		if(s==0&&out[s]+i>f) break;
		if(s!=0&&in[s]<out[s]+i) break;
		out[s] += i;
		in[d]  += i;
		search(s, d+1, sum+i*i+(i>0 ? a[s][d] : 0));
		out[s] -= i;
		in[d]  -= i;
	}
}

int main(){
	while(cin >> n){
		for(int i=0;i<n*(n-1)/2;i++){
			int s, t; cin >> s >> t;
			cin >> l[s-1][t-1] >> h[s-1][t-1] >> a[s-1][t-1];
		}
		f = 100, e = 0;
		memset(in, 0, sizeof(in));
		memset(out, 0, sizeof(out));
		search(0, 1, 0);
		if(f==100) cout << -1 << " " << -1 << endl;
		else       cout <<  f << " " <<  e << endl;
	}
}