#include <bits/stdc++.h>
using namespace std;
int n;
int a[5005];
int nian,yue,ri,shi,fen;
int nian1,yue1,ri1,shi1,fen1;
char o,b,c,d;
char a1,b1,c1,d1;
int sum;
int tot;
int opo;
int anstime;
int sumtime=1440*60;
int a0[15]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int f(int n,int y,int r,int s,int f){
	int oo=0;
	for(int i=1;i<y;i++) oo+=a0[i]*sumtime;
	if(y>2) oo+=sumtime;
	oo+=r*1440+s*60+f;
}

int main(){
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i];
	cin>>nian>>o>>yue>>b>>ri>>c>>shi>>d>>fen;
	cin>>nian1>>a1>>yue1>>b1>>ri1>>c1>>shi1>>d1>>fen1;
	sort(a+1,a+n+1);
	if(nian1>nian){
		if(nian%4==0) {
		    sum+=366;tot++;
		}
		for(int i=1;i+1<nian1-nian;++i){
			if(nian+i%4==0) {
		    	sum+=366;tot++;
			}else {
		    	sum+=365;opo++;	
			}
		}
	}
	if(tot>0){
		anstime+=sumtime*366*tot;
		anstime+=sumtime*365*opo;
	}else{
		anstime+=sumtime*365*opo;
	}
	int xtime=f(nian,yue,ri,shi,fen);
	int ytime=f(nian1,yue1,ri1,shi1,fen1);
	int yyds=anstime-xtime+ytime;
	int ans;
	for(int i=1;i<=n;++i){
		if(a[i]+a[i+1]>yyds){
			ans=i;break;
		}
	} 
	cout<<ans;
}