Minimum Phone Cost

You are given the prices of three phone offers along with their respective warranty costs. For the first offer, the phone cost is \(x\) and the warranty cost is \(w_1\). Similarly, the second and third offers have costs \(y\) with warranty \(w_2\), and \(z\) with warranty \(w_3\) respectively. The total cost for each offer is computed as:

\(C_x = x + w_1\), \(C_y = y + w_2\), and \(C_z = z + w_3\).

Your task is to find and output the minimum total cost among these three offers. The answer is given by:

\(\min\{C_x, C_y, C_z\}\).

inputFormat

The input consists of six space-separated integers provided via standard input (stdin). These integers are: x, w1, y, w2, z, w3. Here, x, y, and z denote the phone prices, whereas w1, w2, and w3 are the respective warranty costs.

outputFormat

Print the minimum total cost among the three offers to standard output (stdout).## sample

900 50 850 100 920 70

950