Author note: I think some of you might remember the problem "Two Melodies" from Eductational Codeforces Round 22. Now it's time to make it a bit more difficult!

Alice is a composer, and recently she had recorded two tracks that became very popular. Now she has got a lot of fans who are waiting for new tracks. 

This time Alice wants to form four melodies for her tracks.

Alice has a sheet with n notes written on it. She wants to take four such non-empty non-intersecting subsequences that all of them form a melody and sum of their lengths is maximal.

Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

Subsequence forms a melody when each two adjacent notes either differ by 1 or are congruent modulo 7.

You should write a program which will calculate maximum sum of lengths of such four non-empty non-intersecting subsequences that all of them form a melody.

Input

The first line contains one integer number n (4 ≤ n ≤ 3000).

The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — notes written on a sheet.

Output

Print maximum sum of lengths of such four non-empty non-intersecting subsequences that all of them form a melody.

Examples

Input

5
1 3 5 7 9


Output

4


Input

5
1 3 5 7 2


Output

5

Note

In the first example it is possible to compose 4 melodies by choosing any 4 notes (and each melody will consist of only one note).

In the second example it is possible to compose one melody with 2 notes — {1, 2}. Remaining notes are used in other three melodies (one note per each melody).
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
  register int data = 0, w = 1;
  register char ch = 0;
  while (!isdigit(ch) && ch != '-') ch = getchar();
  if (ch == '-') w = -1, ch = getchar();
  while (isdigit(ch)) data = 10 * data + ch - '0', ch = getchar();
  return w * data;
}
const int MAX_N = 5e3 + 5;
const int MAX_M = 1e5 + 5;
int N, a[MAX_N], f[MAX_N][MAX_N], bln_nxt[MAX_M], bln_mod[10];
int ans = 0;
int main() {
  N = gi();
  for (int i = 1; i <= N; i++) a[i] = gi();
  for (int i = 0; i <= N; i++) {
    memset(bln_mod, 0, sizeof(bln_mod));
    memset(bln_nxt, 0, sizeof(bln_nxt));
    for (int j = 1; j < i; j++) {
      bln_nxt[a[j]] = max(bln_nxt[a[j]], f[i][j]);
      bln_mod[a[j] % 7] = max(bln_mod[a[j] % 7], f[i][j]);
    }
    for (int j = i + 1; j <= N; j++) {
      f[i][j] = max(bln_nxt[a[j] - 1], bln_nxt[a[j] + 1]) + 1;
      f[i][j] = max(f[i][j], f[i][0] + 1);
      f[i][j] = max(f[i][j], bln_mod[a[j] % 7] + 1);
      f[j][i] = f[i][j];
      bln_nxt[a[j]] = max(bln_nxt[a[j]], f[i][j]);
      bln_mod[a[j] % 7] = max(bln_mod[a[j] % 7], f[i][j]);
      ans = max(ans, f[i][j]);
    }
  }
  printf("%d\n", ans);
  return 0;
}
