//gnc

#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>

using namespace std;

int tmp[6][3];
int tri[6][3];

int main(void){
	int i;
	int a,b,c;
	ifstream in("triangle.txt");

	while(true){
		for(i = 0 ; i < 6 ; i ++){
			in >> a;
			in >> b;
			in >> c;
			tmp[i][0] = a;
			tmp[i][1] = b;
			tmp[i][2] = c;
		}
		int perm_table[6] = {0, 1,2,3,4,5};
		int flag = 0;
		int maxx = 0;

		while(true){

		for(i = 0; i < 6; i++){
			tri[i][0] = tmp[perm_table[i]][0];
			tri[i][1] = tmp[perm_table[i]][1];
			tri[i][2] = tmp[perm_table[i]][2];
		}

		for(int i0= 0 ; i0 < 3 ; i0 ++){
		for(int i1= 0 ; i1 < 3 ; i1 ++){
		for(int i2= 0 ; i2 < 3 ; i2 ++){
		for(int i3= 0 ; i3 < 3 ; i3 ++){
		for(int i4= 0 ; i4 < 3 ; i4 ++){
		for(int i5= 0 ; i5 < 3 ; i5 ++){
			//cout << "tt0" << endl;
			if(tri[0][(i0+1)%3] != tri[1][i1]) continue;
			//cout << "tt1" << endl;
			if(tri[1][(i1+1)%3] != tri[2][i2]) continue;
			//cout << "tt2" << endl;
			if(tri[2][(i2+1)%3] != tri[3][i3]) continue;
			//cout << "tt3" << endl;
			if(tri[3][(i3+1)%3] != tri[4][i4]) continue;
			//cout << "tt4" << endl;
			if(tri[4][(i4+1)%3] != tri[5][i5]) continue;
			//cout << "tt5" << endl;
			if(tri[5][(i5+1)%3] != tri[0][i0]) continue;
			//cout << "tt6" << endl;
			int tempmax=0;
			tempmax += tri[0][(i0+2)%3];
			tempmax += tri[1][(i1+2)%3];
			tempmax += tri[2][(i2+2)%3];
			tempmax += tri[3][(i3+2)%3];
			tempmax += tri[4][(i4+2)%3];
			tempmax += tri[5][(i5+2)%3];
			if(maxx < tempmax) maxx = tempmax;
			flag = 1;
		}}}}}}

		if(!next_permutation(perm_table, perm_table + 6))
			break;
		}
		if(flag == 0){
			cout << "none" << endl;
		}else{
			cout << maxx << endl;
		}
		char c;
		in >> c;
		if(c == '$') break;
	}
}