#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LINF = 1e18;
const int N = 1e5 + 5;
int n;
int x[N], y[N], z[N];
ll ans;
// O(3^n)
void recur(int i, int ty, int tz, ll cost) {
if (i == n + 1) {
ans = min(ans, cost);
return;
}
recur(i + 1, ty, tz, cost + x[i]); // mua món vật thứ i ở siêu thị A
recur(i + 1, ty + 1, tz, cost + max(0, y[i] - ty)); // mua món vật thứ i ở siêu thị B
recur(i + 1, ty, tz + 1, cost + max(0, z[i] - tz)); // mua món vật thứ i ở siêu thị C
}
void do_sub1() {
ans = LINF;
recur(1, 0, 0, 0);
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> z[i];
if (n <= 10) do_sub1();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7IAoKdHlwZWRlZiBsb25nIGxvbmcgbGw7ICAgCgpjb25zdCBsbCBMSU5GID0gMWUxODsgIAoKY29uc3QgaW50IE4gPSAxZTUgKyA1OyAgIAoKaW50IG47ICAgCmludCB4W05dLCB5W05dLCB6W05dOyAgCmxsIGFuczsgIAoKLy8gTygzXm4pCnZvaWQgcmVjdXIoaW50IGksIGludCB0eSwgaW50IHR6LCBsbCBjb3N0KSB7CglpZiAoaSA9PSBuICsgMSkgewoJCWFucyA9IG1pbihhbnMsIGNvc3QpOyAgIAoJCXJldHVybjsgCgl9CgoJcmVjdXIoaSArIDEsIHR5LCB0eiwgY29zdCArIHhbaV0pOyAvLyBtdWEgbcOzbiB24bqtdCB0aOG7qSBpIOG7nyBzacOqdSB0aOG7iyBBCglyZWN1cihpICsgMSwgdHkgKyAxLCB0eiwgY29zdCArIG1heCgwLCB5W2ldIC0gdHkpKTsgLy8gbXVhIG3Ds24gduG6rXQgdGjhu6kgaSDhu58gc2nDqnUgdGjhu4sgQgoJcmVjdXIoaSArIDEsIHR5LCB0eiArIDEsIGNvc3QgKyBtYXgoMCwgeltpXSAtIHR6KSk7ICAvLyBtdWEgbcOzbiB24bqtdCB0aOG7qSBpIOG7nyBzacOqdSB0aOG7iyBDICAKfQoKdm9pZCBkb19zdWIxKCkgewoJYW5zID0gTElORjsgIAoJcmVjdXIoMSwgMCwgMCwgMCk7ICAgCgljb3V0IDw8IGFucyA8PCAnXG4nOwp9CgppbnQgbWFpbigpIHsKCWlvczo6c3luY193aXRoX3N0ZGlvKDApOyBjaW4udGllKDApOyAgCgljaW4gPj4gbjsgCglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIGNpbiA+PiB4W2ldID4+IHlbaV0gPj4geltpXTsgICAKCglpZiAobiA8PSAxMCkgZG9fc3ViMSgpOyAgICAgCn0=