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;
const long double EPS = 1e-14;
const int maxn = 100500;
const int mod = 1e9 + 7;
int dp[5050][5050], maxmod[10], maxval[maxn], a[5050];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  int ans = 0;
  for (int j = 0; j <= n; ++j) {
    memset(maxmod, 0, sizeof maxmod);
    memset(maxval, 0, sizeof maxval);
    for (int i = 0; i < j; ++i) {
      dp[i][j] = dp[j][i];
      maxmod[a[i] % 7] = max(maxmod[a[i] % 7], dp[i][j]);
      maxval[a[i]] = max(maxval[a[i]], dp[i][j]);
    }
    for (int i = j + 1; i <= n; ++i) {
      dp[i][j] = 1 + max({dp[0][j], maxmod[a[i] % 7], maxval[a[i] + 1],
                          maxval[a[i] - 1]});
      maxmod[a[i] % 7] = max(maxmod[a[i] % 7], dp[i][j]);
      maxval[a[i]] = max(maxval[a[i]], dp[i][j]);
      ans = max(ans, dp[i][j]);
    }
  }
  cout << ans << '\n';
  return 0;
}
