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 void chkmax(int& x, int y) {
  if (y > x) x = y;
}
inline int read() {
  int X = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') X = X * 10 + c - '0', c = getchar();
  return X * w;
}
const int MAXN = 5000 + 10;
int n, ans;
int a[MAXN];
int f[MAXN][MAXN];
int maxmod[8], maxnum[100001];
int main() {
  n = read();
  for (register int i = 1; i <= n; ++i) a[i] = read();
  for (register int i = 0; i <= n; ++i) {
    memset(maxmod, 0, sizeof(maxmod));
    memset(maxnum, 0, sizeof(maxnum));
    for (register int j = 1; j <= i; ++j) {
      chkmax(maxmod[a[j] % 7], f[i][j]);
      chkmax(maxnum[a[j]], f[i][j]);
    }
    for (register int j = i + 1; j <= n; ++j) {
      chkmax(f[i][j], f[i][0] + 1);
      chkmax(f[i][j], maxmod[a[j] % 7] + 1);
      chkmax(f[i][j], maxnum[a[j] - 1] + 1);
      chkmax(f[i][j], maxnum[a[j] + 1] + 1);
      chkmax(maxmod[a[j] % 7], f[i][j]);
      chkmax(maxnum[a[j]], f[i][j]);
      chkmax(ans, f[j][i] = f[i][j]);
    }
  }
  printf("%d\n", ans);
  return 0;
}
