#include<bits/stdc++.h>
using namespace std;
int n,a[100010],a1,b,c,d,e;
int day[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
bool rn(int a1) {return a1 % 4 == 0 && a1 % 100 != 0 || a1 % 400 == 0;}
long long calc() {
	long long tm = 0;
	bool r = rn(a1);
	if (r) day[2] ++;
	tm += e;
	tm += d * 60;
	for (int i = 1;i <= b;i ++) {
		tm += day[i] * 1440;
	}
	tm += c * 1440;
	for (int i = 0;i <= a1;i ++) {
		if (rn(i)) tm += 366 * 1440;
		else tm += 365 * 1440;
	}
	return tm;
}
int main(){
	cin >> n;
	for (int i = 1;i <= n;i ++) cin >> a[i];
	sort(a + 1,a + n + 1);
	char w;
	cin >> a1 >> w >> b >> w >> c >> w >> d >> w >> e;
	long long k1 = calc();
	cin >> a1 >> w >> b >> w >> c >> w >> d >> w >> e;
	long long k2 = calc();
	long long tm = k2 - k1;
	int cnt = 0;
	for (int i = 1;i <= n;i ++) {
		if (tm < a[i]) break;
		cnt ++;
		tm -= a[i];
	}
	cout << cnt << endl;
	return 0;
}