#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;

ll A[55];
ll B[55];
ll C[55];

void solve() {
    int N;
    cin >> N;
    REP(i, N) cin >> A[i] >> B[i] >> C[i];
    ll s = 0;
    REP(i, N) s += A[i];

    if (N == 1) {
        cout << 0 << endl;
        return;
    }

    vector<pair<ll, ll>> v;
    int M1 = N / 2;
    int M2 = N / 2 + N % 2;


    REP(mask, 1 << M1) {
        if (mask & (mask << 1)) continue;
        ll b = 0;
        ll a = 0;
        REP(i, M1) if (mask & (1 << i)) b += B[i], a += A[i+1] + A[i] + C[i];
        v.push_back({a, b});
    }
    cout << v.size() << endl;

    sort(v.rbegin(), v.rend());
    //REP(i, v.size()) v[i].first *= -1;
    REP2(i, 1, (int)v.size()) v[i].second = max(v[i].second, v[i-1].second);

    //REP(i, v.size()) cout << v[i].first << " " << v[i].second << endl;

    ll ans = 0;

    REP(mask, 1 << M2) {
        if (mask & (mask << 1)) continue;
        if (mask & (1 << (M2 - 1))) continue;
        ll b = 0;
        ll a = 0;
        REP(i, M2) if (mask & (1 << i)) b += B[i], a += A[i+1] + A[i] + C[i];
        int hi = (int)v.size() - 1;
        int lo = -1;
        while (hi - lo > 1) {
            int mid = (hi + lo) / 2;
            if (v[mid].first + a > s) lo = mid;
            else hi = mid;
        }
        ans = max(ans, v[hi].second + b);
    }

    cout << ans << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}