import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;

public class No0268 {

	static final Scanner in = new Scanner(System.in);
	static final PrintWriter out = new PrintWriter(System.out,false);

	static void solve() {
		int l1 = in.nextInt();
		int l2 = in.nextInt();
		int l3 = in.nextInt();
		int r = in.nextInt();
		int b = in.nextInt();
		int y = in.nextInt();
		int[] a = {(l1 + l2)*2, (l2 + l3)*2, (l3 + l1)*2};
		int min = Integer.MAX_VALUE;
		Arrays.sort(a);
		do {
			min = Math.min(min, a[0]*r + a[1]*b + a[2]*y);
		}while (nextPermutation(a));
		out.println(min);
	}

	public static boolean nextPermutation(int[] a) {
		int n = a.length, i, j;
		for (i=n-2; i>=0 && a[i]>=a[i+1]; i--);
		if (i == -1) return false;
		for (j=i+1; j<n && a[i]<a[j]; j++);
		int tmp = a[i]; a[i] = a[j-1]; a[j-1] = tmp;
		for (int l=i+1, r=n-1; l<r; l++,r--) {
			tmp = a[l]; a[l] = a[r]; a[r] = tmp;
		}
		return true;
	}

	public static void main(String[] args) {
		long start = System.currentTimeMillis();

		solve();
		out.flush();

		long end = System.currentTimeMillis();
		//trace(end-start + "ms");
		in.close();
		out.close();
	}

	static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}