Vladik was bored on his way home and decided to play the following game. He took n cards and put them in a row in front of himself. Every card has a positive integer number not exceeding 8 written on it. He decided to find the longest subsequence of cards which satisfies the following conditions:

  * the number of occurrences of each number from 1 to 8 in the subsequence doesn't differ by more then 1 from the number of occurrences of any other number. Formally, if there are ck cards with number k on them in the subsequence, than for all pairs of integers <image> the condition |ci - cj| ≤ 1 must hold. 
  * if there is at least one card with number x on it in the subsequence, then all cards with number x in this subsequence must form a continuous segment in it (but not necessarily a continuous segment in the original sequence). For example, the subsequence [1, 1, 2, 2] satisfies this condition while the subsequence [1, 2, 2, 1] doesn't. Note that [1, 1, 2, 2] doesn't satisfy the first condition. 



Please help Vladik to find the length of the longest subsequence that satisfies both conditions.

Input

The first line contains single integer n (1 ≤ n ≤ 1000) — the number of cards in Vladik's sequence.

The second line contains the sequence of n positive integers not exceeding 8 — the description of Vladik's sequence.

Output

Print single integer — the length of the longest subsequence of Vladik's sequence that satisfies both conditions.

Examples

Input

3
1 1 1


Output

1

Input

8
8 7 6 5 4 3 2 1


Output

8

Input

24
1 8 1 2 8 2 3 8 3 4 8 4 5 8 5 6 8 6 7 8 7 8 8 8


Output

17

Note

In the first sample all the numbers written on the cards are equal, so you can't take more than one card, otherwise you'll violate the first condition.
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1010, M = (1 << 8) + 10;
int n, q[N], x, c[10], a[10][N], mn, f[N][M];
int cur[10];
int cal(int len) {
  int m = (1 << 8) - 1;
  for (int i = 1; i <= n + 1; i++)
    for (int j = 0; j <= m; j++) {
      f[i][j] = -INF;
    }
  f[1][0] = 0;
  memset(cur, 0, sizeof(cur));
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      if (f[i][j] == -INF) {
        continue;
      }
      for (int k = 1; k <= 8; k++) {
        int p = 1 << (k - 1);
        if (p & j) {
          continue;
        }
        int cnt = cur[k] + len - 1;
        if (cnt > c[k]) {
          continue;
        }
        f[a[k][cnt] + 1][j | p] = max(f[a[k][cnt] + 1][j | p], f[i][j]);
        cnt++;
        if (cnt > c[k]) {
          continue;
        }
        f[a[k][cnt] + 1][j | p] = max(f[a[k][cnt] + 1][j | p], f[i][j] + 1);
      }
    }
    cur[q[i]]++;
  }
  int ans = -INF;
  for (int i = 1; i <= n + 1; i++) {
    ans = max(ans, f[i][m]);
  }
  if (ans == -INF) {
    return -1;
  }
  return ans * len + (8 - ans) * (len - 1);
}
int main() {
  scanf("%d", &n);
  memset(c, 0, sizeof(c));
  q[0] = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    q[i] = x;
    c[x]++;
    a[x][c[x]] = i;
  }
  mn = INF;
  for (int i = 1; i <= 8; i++) {
    mn = min(mn, c[i]);
  }
  int l = 2, r = mn + 1, mid, tmp, ans = -1;
  while (l <= r) {
    mid = (l + r) >> 1;
    tmp = cal(mid);
    if (tmp != -1) {
      l = mid + 1;
      ans = tmp;
    } else {
      r = mid - 1;
    }
  }
  if (ans == -1) {
    ans = 0;
    for (int i = 1; i <= 8; i++)
      if (c[i] > 0) {
        ans++;
      }
  }
  printf("%d\n", ans);
  return 0;
}
