1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define vec vector
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

void slv(){
	int n;
	cin>>n;

	vec<pii> a;
	char ch;
	cin>>ch;
	int t=(ch=='('?1:0);
	rep(i,n){
		int x;
		cin>>x;
		a.pb({t==1?1:-1,x});
		t^=1;
	}

	int m;
	cin>>m;
	vi b;
	cin>>ch;
	t=(ch=='('?1:0);
	rep(i,m){
		int x;
		cin>>x;
		rep(_,x){
			b.pb(t==1?1:-1);
		}
		t^=1;
	}

	m=sz(b);
	vi ps(m);
	rep(i,m){
		if(i) ps[i]+=ps[i-1];
		ps[i]+=b[i];
	}

	const int inf=1e18;
	
	ll sum=0;
	rep(i,n){
		sum+=a[i].fi*a[i].se;
	}

	vi dp(n+1,-inf);
	bool debug=0;
	auto apply=[&](){
		// dp[n]=0;
		if(debug) cout<<"{ ";
		per(i,n){
			int val=dp[i+1];
			if(val==-inf) continue;
			int x=a[i].fi*a[i].se;
			if(x<0){
				val=min(val,0ll)+x;
			}else{
				val+=x;
			}
			if(debug) cout<<i<<" "<<val<<"\n";
			dp[i]=max(dp[i],val);
		}
		if(debug) cout<<" } \n";
	};

	auto range_sum=[&](int l,int r){
		return ps[r]-(!l?0:ps[l-1]);
	};

	int ans=0;
	per(r,m){
		dp=vi(n+1,-inf);
		dp[n]=0;
		apply();
		per(i,r+1){
			vi ndp(n+1,-inf);
			rep(j,n+1){
				// axla maq chasamatebeli j - 1
				int val=dp[j];
				int x=b[i];
				if(x<0){
					val=min(val,0ll)+x;
				}else{
					val+=x;
				}
				// if(r==5 and i==5 and j==2) print(val,x);
				// if(r==5 and i==0) print("ex",val,j);
				ndp[j]=max(ndp[j],val);
			}
			dp=ndp;
			// if(r==5 and i==0){
			// 	rep(j,n+1) cout<<dp[j]<<" ";
			// 	print();
			// }
			// if(r==5 and i==0) debug=1;
			apply();
			debug=0;
			
			// if(r==5){
			// 	rep(j,n+1) cout<<dp[j]<<" ";
			// 	print();
			// }

			if(dp[0]>=0 and range_sum(i,r)+sum==0){
				// print(i,r);
				ans+=1;
			}
		}
	}
	cout<<ans<<"\n";
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);

	int t;
	t=1;
	// cin>>t;

	rep(cs,t){
		slv();
	}
}