#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf = 1LL << 62;
vector<string> enumerate(int N) {
	if (N == 0) return vector<string>({ "" });
	if (N == 1) return vector<string>({ "B" });
	vector<string> rpre1 = enumerate(N - 1);
	vector<string> rpre2 = enumerate(N - 2);
	vector<string> ans;
	for (string i : rpre1) {
		ans.push_back("B" + i);
	}
	for (string i : rpre2) {
		ans.push_back("AC" + i);
	}
	return ans;
}
vector<pair<long long, long long> > calc(int N, vector<long long> A, vector<long long> B, vector<long long> C) {
	// pair = (money, happiness)
	vector<string> ops = enumerate(N);
	vector<pair<long long, long long> > res;
	for (string i : ops) {
		long long money = 0, happiness = 0;
		for (int j = 0; j < N; ++j) {
			if (i[j] == 'B') money += A[j];
			if (i[j] == 'C') money -= C[j], happiness += B[j];
		}
		res.push_back(make_pair(money, happiness));
	}
	return res;
}
long long solve(int N, vector<long long> A, vector<long long> B, vector<long long> C, int sep) {
	vector<pair<long long, long long> > resl = calc(sep, vector<long long>(A.begin(), A.begin() + sep), vector<long long>(B.begin(), B.begin() + sep), vector<long long>(C.begin(), C.begin() + sep));
	vector<pair<long long, long long> > resr = calc(N - sep, vector<long long>(A.begin() + sep, A.end()), vector<long long>(B.begin() + sep, B.end()), vector<long long>(C.begin() + sep, C.end()));
	sort(resl.begin(), resl.end());
	sort(resr.begin(), resr.end());
	vector<long long> mx(resl.size() + 1, -inf);
	for (int i = resl.size() - 1; i >= 0; --i) {
		mx[i] = max(mx[i + 1], resl[i].second);
	}
	int ptr = resl.size();
	long long ans = -inf;
	for (int i = 0; i < resr.size(); ++i) {
		while (ptr != 0 && resr[i].first + resl[ptr - 1].first >= 0) --ptr;
		ans = max(ans, resr[i].second + mx[ptr]);
	}
	return ans;
}
int main() {
	int N;
	cin >> N;
	vector<long long> A(N), B(N), C(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i] >> B[i] >> C[i];
	}
	long long ans1 = solve(N, A, B, C, N / 2);
	long long ans2 = solve(N, A, B, C, N / 2 + 1);
	cout << max(ans1, ans2) << endl;
	return 0;
}