import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;


public class Main{

	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long[][] A=new long[N][3];
		long[][][] dp=new long[N][1<<N][3];
		long INF=Long.MAX_VALUE/3;
		for (int i=0;i<dp.length;++i)
			for (int j=0;j<dp[i].length;++j)
				for (int k=0;k<dp[i][j].length;++k)
					dp[i][j][k]=-INF;
		for (int i=0;i<N;++i) {
			for (int j=0;j<3;++j) {
				A[i][j]=sc.nextLong();
			}
			Arrays.sort(A[i]);
			for (int j=0;j<3;++j) dp[i][1<<i][j]=A[i][j];
		}
		for (int s=0;s<1<<N;++s) {
			for (int cur=0;cur<N;++cur) {
				if ((s&(1<<cur))==0) continue;
				for (int dir=0;dir<3;++dir) {
					for (int next=0;next<N;++next) {
						if ((s&(1<<next))!=0) continue;
						for (int ndir=0;ndir<3;++ndir) {
							int p=0,q=0;
							boolean ok=true;
							for (int i=0;i<2;++i,++p,++q) {
								if (p==dir) ++p;
								if (q==ndir) ++q;
								ok&=A[cur][p]>=A[next][q];
							}
							if (!ok) continue;
							int ns=s|1<<next;
							dp[next][ns][ndir]=Math.max(dp[next][ns][ndir],dp[cur][s][dir]+A[next][ndir]);
						}
					}
				}
			}
		}
		
		long ans=0;
		for (int i=0;i<dp.length;++i)
			for (int j=0;j<dp[i].length;++j)
				for (int k=0;k<dp[i][j].length;++k)
					ans=Math.max(ans,dp[i][j][k]);
		System.out.println(ans);
	}
	
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}