#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <array>

using namespace std;

int main() 
{
    int n;
    cin >> n;
    vector<array<int, 5>> segments(n);
    for (auto& x : segments)
        cin >> x[0] >> x[1] >> x[2] >> x[3] >> x[4];

    int ans = 1000000000;
    for (const auto& seg : segments)
    {
        int cap = min(seg[0], seg[1]) + min(seg[3], seg[4]);
        int rem_cap_a = seg[1] - min(seg[0], seg[1]);
        int rem_cap_b = seg[4] - min(seg[3], seg[4]);
        int rem_a = seg[0] - min(seg[0], seg[1]);
        int rem_b = seg[3] - min(seg[3], seg[4]);

        int cand_a = min(min(rem_a, seg[2]), rem_cap_b);
        int cand_b = min(min(rem_b, seg[2]), rem_cap_a);
        cap += max(cand_a, cand_b);
        ans = min(ans, cap);
    }
    cout << ans << '\n';
    return 0;
}