#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int inf = (int)1e9 + 5;
const long long INF = (long long)1e18 + 5;
struct SegTree {
 private:
  int n;
  vector<int> t;
  vector<vector<int>> upd;
  vector<map<int, int>> count;
  void update_node(int v, int tl, int tr, vector<int> &updated) {
    for (auto e : updated) {
      int minus = count[v][e];
      count[v][e] = 0;
      t[v] -= minus;
      upd[v].push_back(e);
    }
  }
  void push(int v, int tl, int tr) {
    int tm = (tl + tr) / 2;
    update_node(v * 2, tl, tm, upd[v]);
    update_node(v * 2 + 1, tm + 1, tr, upd[v]);
    upd[v].clear();
  }
  void add(int v, int tl, int tr, int pos, int c) {
    if (tl == tr) {
      count[v][c]++;
      t[v]++;
      return;
    }
    push(v, tl, tr);
    int tm = (tl + tr) / 2;
    if (pos <= tm)
      add(v * 2, tl, tm, pos, c);
    else
      add(v * 2 + 1, tm + 1, tr, pos, c);
    t[v] = t[v * 2] + t[v * 2 + 1];
    count[v][c] = count[v * 2][c] + count[v * 2 + 1][c];
  }
  void update(int v, int tl, int tr, int l, int r, int c) {
    if (l > r) return;
    if (tl == l && tr == r) {
      vector<int> temp = {c};
      update_node(v, tl, tr, temp);
      return;
    }
    push(v, tl, tr);
    int tm = (tl + tr) / 2;
    update(v * 2, tl, tm, l, min(tm, r), c);
    update(v * 2 + 1, tm + 1, tr, max(tm + 1, l), r, c);
    t[v] = t[v * 2] + t[v * 2 + 1];
    count[v][c] = count[v * 2][c] + count[v * 2 + 1][c];
  }
  int get_sum(int v, int tl, int tr, int l, int r) {
    if (l > r) return 0;
    if (tl == l && tr == r) return t[v];
    push(v, tl, tr);
    int tm = (tl + tr) / 2;
    int s1 = get_sum(v * 2, tl, tm, l, min(r, tm));
    int s2 = get_sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
    return s1 + s2;
  }

 public:
  SegTree(int sz) {
    n = sz;
    t.resize(4 * n);
    upd.resize(4 * n);
    count.resize(4 * n);
  }
  void add(int pos, int c) { add(1, 0, n - 1, pos, c); }
  void update(int l, int r, int c) { update(1, 0, n - 1, l, r, c); }
  int get_sum(int l, int r) { return get_sum(1, 0, n - 1, l, r); }
  int find(int pos) {
    int l = 0, r = n - 1, mid;
    while (l != r) {
      mid = (l + r) / 2;
      if (get_sum(0, mid) >= pos)
        r = mid;
      else
        l = mid + 1;
    }
    return l;
  }
};
void solve() {
  vector<long long> months = {
      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};
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long m = months.size();
  for (long long i = 0; i + n - 1 < m; i++) {
    bool good = true;
    for (long long j = 0; j < n; j++) {
      if (a[j] != months[i + j]) good = false;
    }
    if (good) {
      cout << "YES";
      return;
    }
  }
  cout << "NO";
}
int main() {
  string filename = "sochi";
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(15);
  solve();
  (void)0;
  return 0;
}
