#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
    return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
    return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
    return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
    return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os<<"{"<<p.ff<<", "<<p.ss<<"}";
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (size_t i = 0; i < v.size(); ++i) {
        if (i) os << ", ";
        os << v[i];
    }
    os << "}";
    return os;
}
template<ll MOD=998244353>
struct mint_t{
    ll x;
    mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
    mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
    mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
    mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
    mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
    mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
    mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
    mint_t fp(ll y)const{
        mint_t a=1,b=x;
        while(y){
            if(y&1)a*=b;
            b*=b;
            y/=2;
        }
        return a;
    }
    mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
    mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
    ll x;
    in>>x;
    a=mint_t<MOD>(x);
    return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
    out<<a.x;
    return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
    if(b>a || a<0)return 0;
    return fct[a]/fct[b]/fct[a-b];
}
bool ok2(vi v1,vi v2){
    vi pr1={0},pr2={0};
    for(ll i=0;i<v1.size();i++){
        pr1.pb(pr1.back());
        if(i%2==0)pr1.back()+=v1[i];
        else pr1.back()-=v1[i];
    }
    for(ll i=0;i<v2.size();i++){
        pr2.pb(pr2.back());
        if(i%2==0)pr2.back()+=v2[i];
        else pr2.back()-=v2[i];
    }
    if(pr1.back()+pr2.back()!=0)return 0;
    //cout<<pr1<<endl<<pr2<<endl;
    vii x1,x2;
   
    ll mx=0;
    ll mn=0;
    for(ll i=1;i<pr1.size();i++){
        if(pr1[i]>mx){
            x1.pb({-mn,pr1[i]});
            mx=pr1[i];
        }
        else mn=min(mn,pr1[i]);
    }
    ll mxo=mx,mno=mn;
    mx=0;
    mn=0;
    for(ll i=1;i<pr2.size();i++){
        if(pr2[i]>mx){
            x2.pb({-mn,pr2[i]});
            mx=pr2[i];
        }
        else mn=min(mn,pr2[i]);
    }
    if(mn+mxo<0 || mx+mno<0)return 0;
    rev(x1);rev(x2);
    ll w1=0,w2=0;
    //cout<<x1<<" "<<x2<<endl;
    while(x1.size() || x2.size()){
        if(x1.size() && w2>=x1.back().ff){
            w1=x1.back().ss;
            x1.pop_back();
        }
        else if(x2.size() && w1>=x2.back().ff){
            w2=x2.back().ss;x2.pop_back();
        }
        else return 0;

        
    }
    
    return 1;
}
bool ok(vi v1,vi v2){//zaczynamy od (
    if(v1.size()%2)v1.pb(0);
    if(v2.size()%2)v2.pb(0);
    bool bl=ok2(v1,v2);
    rev(v1);rev(v2);
    return bl&ok2(v1,v2);
}
void solve(){
    //cout<<ok({1,1},{0,2,1,1,2});exit(0);
    vi v1,v2;
    ll n,m,a;
    cin>>n;
    char c;
    cin>>c;
    if(c==')'){
        v1.pb(0);
    }
    for(ll i=0;i<n;i++){
        cin>>a;
        v1.pb(a);
    }
    ll s1=0;
    for(ll i=0;i<v1.size();i++){
        if(i%2)s1-=v1[i];
        else s1+=v1[i];
    }
    cin>>m;
    cin>>c;
    if(c==')'){
        v2.pb(0);
    }
    for(ll i=0;i<m;i++){
        cin>>a;
        v2.pb(a);
    }
    ll il=0;
    n=v1.size();m=v2.size();
    for(ll i=0;i<m;i++){
        for(ll j=i+1;j<m;j++){
            ll s2=0;
            for(ll k=i+1;k<j;k++){
                if(k%2)s2-=v2[k];
                else s2+=v2[k];
            }
            if(i%2==0 && j%2==0){
                ll sm=-s1-s2;
                ll l=min(v2[i]+1,sm),r=max(1LL,sm-v2[j]);
                if(l<=r)continue;
                //cout<<sm<<" "<<l<<" "<<r<<" ";
                while(l!=r){
                    ll md=(l+r)/2;
                    vi zap;
                    zap.pb(md);
                    for(ll k=i+1;k<j;k++)zap.pb(v2[k]);
                    zap.pb(sm-md);
                   // cout<<zap.back()<<" ";
                    if(ok(v1,zap))l=md;
                    else r=md+1;
                }
               // cout<<i<<" "<<j<<" "<<min(v2[i]+1,sm-1)<<" "<<l<<endl;
                il+=(min(v2[i]+1,sm)-l);
            }
            else if(i%2==1 && j%2==1){
                ll sm=s1+s2;
                ll l=max(0LL,sm-v2[j]-1),r=min(v2[i],sm-1);
                if(l>=r)continue;
                //cout<<sm<<" "<<l<<" "<<r<<" ";
                while(l!=r){
                    ll md=(l+r+1)/2;
                    vi zap={0};
                    zap.pb(md);
                    for(ll k=i+1;k<j;k++)zap.pb(v2[k]);
                    zap.pb(sm-md);
                   // cout<<zap.back()<<" ";
                    if(ok(v1,zap))l=md;
                    else r=md-1;
                }
               // cout<<i<<" "<<j<<" "<<min(v2[i]+1,sm-1)<<" "<<l<<endl;
                il+=(l-max(0LL,sm-v2[j]-1));
            }
            else if(i%2==0 && j%2==1){
                ll sm=-s1-s2;
                ll l=max(1LL,sm+1),r=min(v2[i],sm+v2[j])+1;
                if(l>=r)continue;
                //cout<<sm<<" "<<l<<" "<<r<<" ";
                while(l!=r){
                    ll md=(l+r)/2;
                    vi zap={};
                    zap.pb(md);
                    for(ll k=i+1;k<j;k++)zap.pb(v2[k]);
                    zap.pb(md-sm);
                   // cout<<zap.back()<<" ";
                    if(ok(v1,zap))r=md;
                    else l=md+1;
                }
               // cout<<i<<" "<<j<<" "<<min(v2[i]+1,sm-1)<<" "<<l<<endl;
                il+=(min(v2[i],sm+v2[j])+1-l);
            }
            else{
                ll sm=s1+s2;
                ll l=max(0LL,sm),r=min(v2[i],sm+v2[j]);
                if(l>=r)continue;
                //cout<<sm<<" "<<l<<" "<<r<<" ";
                while(l!=r){
                    ll md=(l+r+1)/2;
                    vi zap={0};
                    zap.pb(md);
                    for(ll k=i+1;k<j;k++)zap.pb(v2[k]);
                    zap.pb(md-sm);
                   // cout<<zap.back()<<" ";
                    if(ok(v1,zap))l=md;
                    else r=md-1;
                }
               // cout<<i<<" "<<j<<" "<<min(v2[i]+1,sm-1)<<" "<<l<<endl;
                il+=(l-max(0LL,sm));
            }
        }
        ll k=abs(s1);
        if(k==0 || k>v2[i])continue;
        vi zap;
        if(i%2)zap={0,k};
        else
        zap={k};
        il+=(ll)ok(v1,zap)*(v2[i]-k+1);
    }
    cout<<il;
}
int main(){
    ios_base::sync_with_stdio(0);
    fct[0]=1;
    for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
    ll t=1;
    //cin>>t;
    for(ll i=1;i<=t;i++){
        //cout<<"Case #"<<i<<": ";
        solve();
    }
}