#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main(){
	int n;
	cin>>n;
	vector<int> fsf(3);
	rep(i, 3) cin>>fsf[i];
	reverse(fsf.begin(), fsf.end());
	vector<int> sn(n);
	rep(i, n){
		string s;
		cin>>s;
		sn[i]=s.size();
	}

	vector<bool> dp(n+1, 1);
	for(int k : fsf){
		int r=0, c=0;
		rep(i, n){
			for(; r<n && c+sn[r]<=k; r++) c+=sn[r];
			if(c==k) dp[i]=dp[r];
			else dp[i]=0;

			if(i==r) r++;
			else c-=sn[i];
		}
		dp[n]=0;
	}

	int cnt=0;
	rep(i, n) if(dp[i]) cnt++;
	cout<<cnt<<endl;
	return 0;
}