input()
print('Yes' if input() in ('31 28 31 30 31 30 31 31 30 31 30 31 '*3+'31 29 31 30 31 30 31 31 30 31 30 31 ')*2 else 'No')
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int mod=1e9+7;
signed main()
{
int t,go=0,co=0,e,ro=0;
cin>>t;
int a[t];
for(int i=0;i<t;i++){cin>>a[i];}
for(int i=0;i<t;i++){
if(a[i]==30 && i!=t-1 ){
if(a[i+1]==30){go++;
}
}
if((a[i]==29 || a[i]==28) && i!=t-1 ){
if(a[i+1]!=31)go++;
}
if(a[i]==28 || a[i]==29){
ro++;
if(co==0){
co++;
e=i;}
else{
if(i-e !=12)go++;
}
}
if(a[i]==29 && i+12<=t-1){
if(a[i+12]==29 || a[i+12]==30||a[i+12]==31 )go++;
}
}
if(ro==0 && t>11)go++;
co=0;
for(int i=0;i<t;i++){
if(a[i]==31 && i!=t-1){
if(a[i+1]==31){
if(co==0){
e=i;
co++;
}
else{
if(i-e !=5 && i-e!=7)go++;
else e=i;
}
}
}
}
if(go==0)cout<<"YES";
else cout<<"NO";
return 0;
}
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |