mtmatt.Page

#include<bits/stdc++.h>
using namespace std;

int dayInM[12]={31,28,31,30,31,30,31,31,30,31,30,31};

void check(int y){
    if((y%4==0 && y%100!=0) || y%400==0){
        dayInM[1]=29;
    }else{
        dayInM[1]=28;    
    }
    return;
}

int gcd(int a,int b){
    if(a%b==0){
        return b;
    }else{
        return gcd(b,a%b);
    }
}

int main(){
    int n;
    scanf("%d",&n);

    int dt[500];
    for(int i=0;i<n;i++){
        scanf("%d",dt+i);
    }

    int y,m,d;
    scanf("%d/%d/%d",&y,&m,&d);
    for(int i=0;i<n-1;i++){
        int d=gcd(dt[i],dt[i+1]);
        int min=d*dt[i]/d*dt[i+1]/d;
        dt[i+1]=min;
    }

    d+=dt[n-1];

    check(y);
    while(d>dayInM[m-1]){
        d-=dayInM[m-1];
        m++;
        if(m>12){
            m=1;
            y++;
        }
        check(y);
    }
    printf("%4d/%02d/%02d",y,m,d);
    return 0;
}

void countSwaps(vector<int> a) {
    int ct=0;
    for(int i=0;i<a.size();i++){
        for (int j=0;j<a.size()-1;j++){
            if (a[j]>a[j+1]){
                ct++;
                swap(a[j],a[j+1]);
            }
        }
    }
    cout<<"Array is sorted in "<<ct<<" swaps."<<"\n";
    cout<<"First Element: "<<a[0]<<"\n";
    cout<<"Last Element: "<<a[a.size()-1];
    return;
}

int maximumToys(vector<int> ps, int k){
    sort(ps.begin(),ps.end());
    int sum=0,ct=0;
    for(auto a:ps){
        if(sum+a<k){
            sum+=a;
            ct++;
        }else break;
    }
    return ct;
}

int hourglassSum(vector<vector<int>> arr) {
    int mx=-0x3f3f3f3f;
    for(int i=0;i<arr.size()-2;i++){
        for(int j=0;j<arr[i].size()-2;j++){
            int sum=arr[i][j]+
                    arr[i][j+1]+
                    arr[i][j+2]+
                    arr[i+1][j+1]+
                    arr[i+2][j]+
                    arr[i+2][j+1]+
                    arr[i+2][j+2];
            mx=max(mx,sum);
        }
    }
    return mx;
}

vector<int> rotLeft(vector<int> a, int d) {
    vector<int> ans;

    int pos=d%a.size();
    for(int i=0;i<a.size();i++){
        ans.push_back(a[pos]);
        pos++;
        pos%=a.size();
    }
    return ans;
}

void minimumBribes(vector<int> q){
    int ans=0;
    for(int i=q.size()-1;i>=0;i--) {
        if(q[i]-(i+1)>2){
            cout<<"Too chaotic\n";
            return;
        }
        for(int j=max(0,q[i]-2);j<i;j++)
            if(q[j]>q[i])ans++;
    }
    cout<<ans<<"\n";
}

void checkMagazine(vector<string> magazine, vector<string> note) {
    unordered_map<string,int> m,n;
    for(auto a:magazine){
        m[a]++;
    }
    for(auto a:note){
        n[a]++;
    }

    for(auto a:n){
        if(m[a.first]<n[a.first]){
            cout<<"No\n";
            return;
        }
    }
    cout<<"Yes\n";
}

struct edge{
    int s,e,c;
};

long arrayManipulation(int n, vector<edge> q) {
    long mx=0,now=0;
    sort(q.begin(),q.end(),[](edge a,edge b){
        return a.s<b.s;
    });
    vector<edge> bk(q);
    sort(bk.begin(),bk.end(),[](edge a,edge b){
        return a.e<b.e;
    });

    int i=0;
    for(auto a:q){
        now+=a.c;
        while(i<q.size() && a.s>bk[i].e){
            now-=bk[i].c;
            i++;
        }
        mx=max(mx,now);
    }
    return mx;
}

string twoStrings(string s1, string s2) {
    unordered_set<char> s;
    for(auto a:s1){
        s.insert(a);
    }
    for(auto a:s2){
        if(s.count(a)){
            return "YES";
        }
    }
    return "NO";
}

int minimumSwaps(vector<int> arr) {
    vector<int> o(arr);
    sort(o.begin(),o.end());
    int ct=0,update=0;
    int m[100010]{0};
    for(int i=0;i<arr.size();i++){
        if(arr[i]!=o[i]){
            swap(arr[i],arr[arr[i]-1]);
            ct++;
            i--;
        }
    }
    return ct;
}