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;
template <class T, class U>
inline void chmin(T &t, U f) {
  if (t > f) t = f;
}
template <class T, class U>
inline void chmax(T &t, U f) {
  if (t < f) t = f;
}
int n;
vector<int> vec[8];
int calc(int len) {
  int dp[1 << 8][1001];
  for (int i = 0; i < (1 << 8); i++) {
    for (int j = 0; j < (n + 1); j++) {
      dp[i][j] = -1;
    }
  }
  dp[0][0] = 0;
  for (int i = 0; i < (n); i++) {
    for (int bit = 0; bit < (1 << 8); bit++) {
      if (dp[bit][i] == -1) continue;
      for (int next = 0; next < (8); next++) {
        if ((1 << next) & bit) continue;
        int pos = (int)(lower_bound((vec[next]).begin(), (vec[next]).end(), i) -
                        vec[next].begin());
        if (pos + len <= vec[next].size()) {
          chmax(dp[(1 << next) | bit][vec[next][pos + len - 1] + 1],
                dp[bit][i] + len);
        }
        if (pos + len - 1 <= vec[next].size()) {
          if (len == 1) continue;
          chmax(dp[(1 << next) | bit][vec[next][pos + len - 2] + 1],
                dp[bit][i] + len - 1);
        }
      }
      chmax(dp[bit][i + 1], dp[bit][i]);
    }
  }
  int ret = 0;
  if (len == 1) {
    for (int i = 0; i < (1 << 8); i++) {
      chmax(ret, dp[i][n]);
    }
  } else {
    chmax(ret, dp[(1 << 8) - 1][n]);
  }
  return ret;
}
int main() {
  cin >> n;
  for (int i = 0; i < (n); i++) {
    int a;
    cin >> a;
    vec[a - 1].push_back(i);
  }
  int left = 0, right = n + 1;
  int ans = 0;
  while (right - left > 1) {
    int mid = (left + right) / 2;
    int temp = calc(mid);
    if (temp == 0) {
      right = mid;
    } else {
      left = mid;
    }
  }
  ans = calc(left);
  cout << ans << endl;
}
