#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ll f(vector<pl>Q){
	vector<pl>T;
	for(auto[x,y]:Q){
		if(sz(T)>1&&T[sz(T)-2].first==x&&T[sz(T)-1].first==3){
			T[sz(T)-2].second+=T[sz(T)-1].second+y;
			T.erase(T.end()-1);
		}
		else T.emplace_back(pl(x,y));
	}
	ll N=sz(T);
	vl DP(N+1);
	DP[1]=T[0].second*T[0].second;
	rep(i,2,N+1)DP[i]=max(DP[i-1]+T[i-1].second*T[i-1].second,DP[i-2]+(T[i-1].second+T[i-2].second)*(T[i-1].second+T[i-2].second));
	return DP[N];
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N;cin>>N;
  vl A(N);cin>>A;
  ll M;cin>>M;
  vl B(M);cin>>B;
  vl C(N+1),D(M+1);
  rep(i,0,N)C[i+1]=A[i]+C[i];
  rep(i,0,M)D[i+1]=B[i]+D[i];
  vl X=C;
  X.insert(X.end(),all(D));
  sort(all(X));
  X.erase(unique(all(X)),X.end());
  ll L=sz(X)-1;
  vl S(L);
  ll t=0;
  rep(i,0,N)while(X[t]<C[i+1])S[t]+=1-i%2,t++;
  t=0;
  rep(i,0,M)while(X[t]<D[i+1])S[t]+=2*(1-i%2),t++;
  ll ans=0;
  rep(i,0,L)if(S[i]){
  	ll j=i++;
  	while(i<L&&S[i]&&S[i-1]+S[i]!=3)i++;
  	vector<pl>Q;
  	rep(k,j,i)Q.emplace_back(pl(S[k],X[k+1]-X[k]));
  	ans+=f(Q);
  	i--;
  }
  cout<<ans<<endl;
  return 0;
}