#include<bits/stdc++.h>
using namespace std;
int a[5005];
int mm[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int main(){
    int n;
    int y,m,d,h,M,y1,m1,d1,h1,M1;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    scanf("%d-%d-%d-%d:%d",&y,&m,&d,&h,&M);
    scanf("%d-%d-%d-%d:%d",&y1,&m1,&d1,&h1,&M1);
    long long ans=0,ans1=0;
    ans+=M;
    ans+=h*60;
    ans+=d*24*60;
    if(y%4==0&&y%100!=0||y%400==0){
        mm[2]=29;
    }else mm[2]=28;
    for(int i=1;i<m;i++){
        ans+=mm[i]*24*60;
    }
    for(int i=1;i<y;i++){
        if(i%4==0&&i%100!=0||i%400==0){
            ans+=366;
        }else ans+=365;
    }

    ans1+=M1;
    ans1+=h1*60;
    ans1+=d1*24*60;
    if(y1%4==0&&y1%100!=0||y1%400==0){
        mm[2]=29;
    }else mm[2]=28;
    for(int i=1;i<m1;i++){
        ans1+=mm[i]*24*60;
    }
    for(int i=1;i<y1;i++){
        if(i%4==0&&i%100!=0||i%400==0){
            ans1+=366;
        }else ans1+=365;
    }
    long long sum=ans1-ans,sum1=0;
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(sum>=a[i]){
            sum-=a[i];
            sum1++;
        }else break;
    }
    cout<<sum1;
    return 0;
}