#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 5e5+5;
const ll MOD = 1e9+7;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<int> x(n), y(n), z(n);
for(int i = 0; i < n; i++)
cin >> x[i] >> y[i] >> z[i];
int ans = -1;
for(int i = 0, a, b, c; i < n-2; i++) {
for(int j = i+1; j < n-1; j++) {
for(int k = j+1; k < n; k++) {
a = max({x[i], x[j], x[k]});
b = max({y[i], y[j], y[k]});
c = max({z[i], z[j], z[k]});
if((x[i] == a) + (y[i] == b) + (z[i] == c) != 1) continue;
if((x[j] == a) + (y[j] == b) + (z[j] == c) != 1) continue;
if((x[k] == a) + (y[k] == b) + (z[k] == c) != 1) continue;
ans = max(ans, a + b + c);
}
}
}
cout << ans << "\n";
}
