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;
int dp[1001][1 << 8];
bool done[1001][1 << 8];
vector<int> in[8];
int n;
int a[1001];
int freq[1001][8];
int glen;
void pm(int mask) {
  int p = 8;
  while (p--) {
    printf("%d", mask % 2);
    mask /= 2;
  }
}
int getIndex(int i, int k, int len) {
  if (len == 0) return i;
  if (freq[i][k] < len) return -1;
  int idx = freq[i][k] - len;
  return in[k][idx] - 1;
}
int solve(int i, int mask) {
  if (i == 0 && mask == 0) return 0;
  if (i < 0) return -(1000000000);
  int &temp = dp[i][mask];
  if (done[i][mask]) return temp;
  int ret = -(1000000000);
  int newIdx, newMask, val;
  for (int k = 0; k < 8; k++)
    if (mask & (1 << k)) {
      newMask = mask ^ (1 << k);
      newIdx = getIndex(i, k, glen);
      val = solve(newIdx, newMask);
      ret = max(val, ret);
      newIdx = getIndex(i, k, glen + 1);
      val = solve(newIdx, newMask);
      if (val != -(1000000000)) ret = max(ret, val + 1);
    }
  ret = max(solve(i - 1, mask), ret);
  temp = ret;
  done[i][mask] = true;
  return ret;
}
int check(int len) {
  memset(dp, -1, sizeof(dp));
  memset(done, false, sizeof(done));
  int val = -(1000000000);
  val = solve(n, (1 << 8) - 1);
  int ret = val == -(1000000000) ? val : val * (len + 1) + (8 - val) * len;
  return ret;
}
int search(int lo, int hi) {
  if (lo > hi) return -(1000000000);
  int m = lo + hi;
  m = m / 2;
  glen = m;
  int val = check(m);
  if (val == -(1000000000)) return search(lo, m - 1);
  return max(val, search(m + 1, hi));
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i]--;
    for (int k = 0; k < 8; k++) freq[i][k] = freq[i - 1][k];
    freq[i][a[i]]++;
    in[a[i]].push_back(i);
  }
  int val = search(0, n);
  printf("%d\n", val);
  return 0;
}
