#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
  long long int r = 1;
  while (y > 0) {
    if (y % 2 != 0) r = r * x;
    x = x * x;
    y = y / 2;
  }
  return r;
}
long long int ncr(long long int n, long long int k) {
  long long int c[k + 1];
  memset(c, 0, sizeof(c));
  c[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = min(i, k); j > 0; j--) c[j] = c[j] + c[j - 1];
  }
  return c[k];
}
bool prime[1000001];
void sieve() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  long long int i, j;
  for (i = 2; i <= sqrt(1000000); i++) {
    if (prime[i]) {
      for (j = i * i; j <= 1000000; j = j + i) prime[j] = false;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, i, f = 0, j;
  cin >> n;
  long long int a[n];
  for (i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == 29) f = 1;
  }
  long long int k, z = 0;
  long long int c[48] = {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, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  long long int d[84] = {
      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, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  if (f == 1) {
    for (i = 0; i < 84; i++) {
      if (a[0] == d[i]) {
        k = i;
        z = 0;
        for (j = 0; j < n && k < 84; j++) {
          if (a[j] == d[k]) {
            k++;
            z++;
          } else
            break;
        }
        if (z >= n) {
          cout << "Yes\n";
          return 0;
        }
      }
    }
    cout << "No\n";
    return 0;
  } else {
    for (i = 0; i < 48; i++) {
      if (a[0] == c[i]) {
        k = i;
        z = 0;
        for (j = 0; j < n && k < 48; j++) {
          if (a[j] == c[k]) {
            k++;
            z++;
          } else
            break;
        }
        if (z >= n) {
          cout << "Yes\n";
          return 0;
        }
      }
    }
    cout << "No\n";
    return 0;
  }
  return 0;
}
