//qoj3506
#include <bits/stdc++.h>
using namespace std;

int vs[150010];
int n;

int main(){
    scanf("%d", &n);
    priority_queue<pair<int, int> > a, b, c;
    for(int i = 1; i <= n; ++ i){
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        a.push(make_pair(x, i));
        b.push(make_pair(y, i));
        c.push(make_pair(z, i));
    }
    while(a.size() && b.size() && c.size()){
        pair<int, int> x = a.top();
        pair<int, int> y = b.top();
        pair<int, int> z = c.top();
        if(vs[x.second]){
            a.pop();
            continue;
        }
        if(vs[y.second]){
            b.pop();
            continue;
        }
        if(vs[z.second]){
            c.pop();
            continue;
        }
        if(x.second == y.second && y.second == z.second){
            vs[x.second] = 1;
            a.pop();
            b.pop();
            c.pop();
        } else if(x.second == y.second){
            vs[x.second] = 1;
            a.pop();
            b.pop();
        } else if(y.second == z.second){
            vs[y.second] = 1;
            b.pop();
            c.pop();
        } else if(x.second == z.second){
            vs[x.second] = 1;
            a.pop();
            c.pop();
        } else {
            printf("%d\n", x.first + y.first + z.first);
            return 0;
        }
    }
    puts("-1");
    return 0;
}