#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

constexpr int N = 100200;

#define int long long

int n;
int a[N];
int b[N];
int c[N];
int d[N];
int e[N];

signed main() {
    cin >> n;
    for (int i=0; i<n; i++)
    {
        cin >> a[i];
        cin >> b[i];
        cin >> c[i];
        cin >> d[i];
        cin >> e[i];
    }

    int res = INT_MAX;
    for (int i=0; i<n; i++) {
        int up = a[i];
        int down = d[i];
        int exceedUp = a[i]-b[i];
        int exceedDown = d[i]-e[i];
        if (exceedUp > 0) {
            down += min(c[i], exceedUp);
        } else if (exceedDown > 0) {
            up += min(c[i], exceedDown);
        }
        int ans = min(up, b[i]) + min(down, e[i]);
        res = min(res, ans);
    }
    cout << res << endl;
}