#include<cstring>#include<cstdio>#include<algorithm>usingnamespace std;int s[4];int w[25],dp[2000];intsolve(int n){int sum =0;memset(dp,0,sizeof(dp));for(int i =1;i <= n;i++){scanf("%d",w+i);
sum+=w[i];}for(int i =1;i <= n;i++){for(int c = sum/2;c >=0;c--){if(c >= w[i]){
dp[c]=max(dp[c],dp[c-w[i]]+w[i]);}}}return sum-dp[sum/2];}intmain(){for(int i =0;i <4;i++)scanf("%d",s+i);int ans =0;for(int i =0;i <4;i++) ans+=solve(s[i]);printf("%d\n",ans);return0;}