import java.util.Scanner;

public class Sheep {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int repeat = in.nextInt();
        long input = Long.MAX_VALUE;
        for (int i = 0; i < repeat; i++) {
            long output = 0;
            long in_up = in.nextInt();
            long out_up = in.nextInt();
            long bridge = in.nextInt();
            long in_down = in.nextInt();
            long out_down = in.nextInt();
            if (out_up >= in_up) { // remaining out capacity on top
                long moveUp = in_up;
                output += moveUp;
                out_up -= moveUp;
                if (out_down >= in_down) { // remaining out capacity on bottom
                    long moveDown =in_up;
                    output += moveDown;
                    // end
                } else {
                    long moveDown =out_down;
                    in_down -= moveDown;
                    long moveBridge = Math.min(in_down, Math.min(bridge, out_up));
                    output += moveDown+moveBridge;
                }
            } else {
                long moveUp = out_up;
                output += moveUp;
                in_up -= moveUp;
                if (out_down >= in_down) {
                    long moveDown = in_down;
                    out_down -= moveDown;
                    long moveBridge = Math.min(in_up, Math.min(bridge, out_down));
                    output += moveDown+moveBridge;
                    // end
                } else {
                    long moveDown = out_down;
                    output += moveDown;
                }
            }
            input = Math.min(input, output);
        }
        System.out.println(input);
    }
}