日期暴力

Everybody in Russia uses Gregorian calendar. In this calendar there are 31 days in January, 28 or 29 days in February (depending on whether the year is leap or not), 31 days in March, 30 days in April, 31 days in May, 30 in June, 31 in July, 31 in August, 30 in September, 31 in October, 30 in November, 31 in December.

A year is leap in one of two cases: either its number is divisible by 4, but not divisible by 100, or is divisible by 400. For example, the following years are leap: 2000, 2004, but years 1900 and 2018 are not leap.

In this problem you are given n (1 ≤ n ≤ 24) integers a1, a2, ..., an, and you have to check if these integers could be durations in days of n consecutive months, according to Gregorian calendar. Note that these months could belong to several consecutive years. In other words, check if there is a month in some year, such that its duration is a1 days, duration of the next month is a2 days, and so on.

The first line contains single integer n (1 ≤ n ≤ 24) — the number of integers.

The second line contains n integers a1, a2, ..., an (28 ≤ ai ≤ 31) — the numbers you are to check.

If there are several consecutive months that fit the sequence, print "YES" (without quotes). Otherwise, print "NO" (without quotes).

You can print each letter in arbitrary case (small or large).

4
31 31 30 31

Output

Yes

Input

2
30 30

Output

No

Input

5
29 31 30 31 30

Output

Yes

Input

3
31 28 30

Output

No

Input

3
31 31 28

Output

Yes

#include<stdio.h>
#include<iostream>
#include<cmath>
#include<string.h>
#include<stdlib.h>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
    int n,a[200],b,i,j,ge,sum,k,c[100]=
    {
        31,28,31,30,31,30,31,31,30,31,30,31,
        31,28,31,30,31,30,31,31,30,31,30,31,
        31,28,31,30,31,30,31,31,30,31,30,31,
        31,29,31,30,31,30,31,31,30,31,30,31,
        31,28,31,30,31,30,31,31,30,31,30,31,
        31,28,31,30,31,30,31,31,30,31,30,31
    };
    scanf("%d",&n);
    ge=0;
    for(i=0; i<=n-1; i++)
    {
         scanf("%d",&a[i]);
         if(a[i]==29)
            ge++;
    }
    if(ge>=2)
    {
        printf("No\n");
        return 0;

    }
     ge=0;
    for(i=0; i<=72-n; i++)
    {
        k=i;
        for(j=0; j<=n-1; j++)
        {
            if(a[j]==c[k++])
                ge++;
            else
                break;
        }
        if(ge==n)
        {
            printf("Yes\n");
            return 0;
        }
        else
            ge=0;
    }
    printf("No\n");




}