#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
ll mx = -1;
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j + 1; k < n; k++) {
vector<bool> vis(3);
vis[0] = (a[i] > max(a[j], a[k]) || b[i] > max(b[j], b[k]) || c[i] > max(c[j], c[k]));
vis[1] = (a[j] > max(a[i], a[k]) || b[j] > max(b[i], b[k]) || c[j] > max(c[i], c[k]));
vis[2] = (a[k] > max(a[i], a[j]) || b[k] > max(b[i], b[j]) || c[k] > max(c[i], c[j]));
if (vis[0] && vis[1] && vis[2]) {
mx = max(mx, (ll)max({a[i], a[j], a[k]}) + max({b[i], b[j], b[k]}) + max({c[i], c[j], c[k]}));
}
}
}
}
cout << mx;
}
