#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int64_t solvesheep(int64_t A, int64_t B, int64_t C, int64_t D, int64_t E)
{
    int64_t minAB = min(A,B);
    int64_t minDE = min(D,E);
    int64_t F = min(A,B)+min(D,E);
    if ((A-B) > (D-E))
    {
        F+=min(min(A-minAB, C), E-minDE);
    }else
    {
        F+=min(min(D-minDE, C), B-minAB);
    }
    return F;
}

int main()
{
    int64_t N;
    cin >> N;
    vector<int> results(N);
    for(int64_t i = 0; i < N; i++)
    {
        int64_t A,B,C,D,E;
        cin >> A >> B >> C >> D >> E;
        results[i] = solvesheep(A,B,C,D,E);
    }
    cout << *min_element(results.begin(), results.end()) << "\n";

    return 0;
}