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.
import java.io.*;
import java.util.*;
public final class vladik_and_cards
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static Random rnd=new Random();
	static int[][][] val;
	static int[][] dp;
	static int[] a;
	static int maxn=128,n;
	static boolean[] v;
	
	static void clear()
	{
		dp=new int[n][1<<8];
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<(1<<8);j++)
			{
				dp[i][j]=-1;
			}
		}
	}
	
	static int solve(int idx,int mask,int curr)
	{
		if(idx>=n)
		{
			return (mask==255?0:-10000);
		}
		if(dp[idx][mask]!=-1)
		{
			return dp[idx][mask];
		}
		else
		{
			int max=solve(idx+1,mask,curr);
			for(int i=0;i<8;i++)
			{
				if((mask&(1<<i))==0)
				{
					if(val[i][curr][idx]!=-1)
					{
						max=Math.max(max,curr+solve(val[i][curr][idx]+1,mask|(1<<i),curr));
					}
					if(val[i][curr-1][idx]!=-1)
					{
						max=Math.max(max,curr-1+solve(val[i][curr-1][idx]+1,mask|(1<<i),curr));
					}
				}
			}
			dp[idx][mask]=max;return max;
		}
	}
	
    public static void main(String args[]) throws Exception
    {
		n=sc.nextInt();a=new int[n];val=new int[8][maxn][n];v=new boolean[8];int max=0;
		for(int i=0;i<n;i++)
		{
			a[i]=sc.nextInt()-1;
			if(!v[a[i]])
			{
				v[a[i]]=true;max++;
			}
		}
		for(int i=0;i<8;i++)
		{
			for(int j=0;j<maxn;j++)
			{
				for(int k=0;k<n;k++)	
				{
					val[i][j][k]=-1;
				}
			}
		}
		for(int i=0;i<8;i++)
		{
			for(int j=0;j<n;j++)
			{
				int curr=1;
				for(int k=j;k<n;k++)
				{
					if(curr>=maxn)
					{
						break;
					}
					if(a[k]==i)
					{
						val[i][curr++][j]=k;
					}
				}
			}
		}
		/*
		for(int i=0;i<8;i++)
		{
			for(int j=0;j<maxn;j++)
			{
				for(int k=0;k<n;k++)
				{
					System.out.println(i+" "+j+" "+k+" "+val[i][j][k]);
				}
			}
		}
		*/
		for(int i=2;i<128;i++)
		{
			clear();max=Math.max(max,solve(0,0,i));
		}
		out.println(max);out.close();
    }
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}