Problem: Consider a binary tree whose leaves are assigned integer weights. Such a tree is called balanced if, for every non-leaf node, the sum of the weights in its left subtree is equal to that in the right subtree. For instance, the tree in the following figure is balanced.

<image>
Figure I.1. A balanced tree


A balanced tree is said to be hidden in a sequence A, if the integers obtained by listing the weights of all leaves of the tree from left to right form a subsequence of A. Here, a subsequence is a sequence that can be derived by deleting zero or more elements from the original sequence without changing the order of the remaining elements.

For instance, the balanced tree in the figure above is hidden in the sequence 3 4 1 3 1 2 4 4 6, because 4 1 1 2 4 4 is a subsequence of it.

Now, your task is to find, in a given sequence of integers, the balanced tree with the largest number of leaves hidden in it. In fact, the tree shown in Figure I.1 has the largest number of leaves among the balanced trees hidden in the sequence mentioned above.



Input

The input consists of multiple datasets. Each dataset represents a sequence A of integers in the format


N
A1 A2 . . . AN


where 1 ≤ N ≤ 1000 and 1 ≤ Ai ≤ 500 for 1 ≤ i ≤ N. N is the length of the input sequence, and Ai is the i-th element of the sequence.

The input ends with a line consisting of a single zero. The number of datasets does not exceed 50.

Output

For each dataset, find the balanced tree with the largest number of leaves among those hidden in A, and output, in a line, the number of its leaves.

Example

Input

9
3 4 1 3 1 2 4 4 6
4
3 12 6 3
10
10 9 8 7 6 5 4 3 2 1
11
10 9 8 7 6 5 4 3 2 1 1
8
1 1 1 1 1 1 1 1
0


Output

6
2
1
5
8

Solution (in CPP):

Solution:
#include <stdio.h>
#include <string.h>
#include <utility>
#include <algorithm>

using namespace std;

const int MAXN = 1000;
int n;
int a[MAXN], b[MAXN], c[MAXN];
bool v[MAXN];
int f[2][1<<20];
int que[2][1<<20], head[2], tail[2];
int mark[1<<20];
int ans;

void init()
{
	for (int i = 0; i < n; ++i) {
		scanf("%d", &a[i]);
		b[i] = 0;
		while (~a[i]&1) {
			++b[i];
			a[i] >>= 1;
		}
	}
}

int dp(int a[], int n)
{
	static int stamp = 0;
	f[0][0] = 0;
	head[0] = tail[0] = 0;
	f[0][tail[0]++] = 0;
	for (int i = 0; i < n; ++i) {
		++stamp;
		head[~i&1] = tail[~i&1] = 0;
		while (head[i&1] < tail[i&1]) {
			int mask = que[i&1][head[i&1]++];
			if (mark[mask] != stamp) {
				f[~i&1][mask] = f[i&1][mask];
				que[~i&1][tail[~i&1]++] = mask;
				mark[mask] = stamp;
			} else {
				f[~i&1][mask] = max(f[~i&1][mask], f[i&1][mask]);
			}
			if (mask&((1<<a[i])-1)) continue;
			int nmask = mask + (1<<a[i]);
			if (mark[nmask] != stamp) {
				f[~i&1][nmask] = f[i&1][mask] + 1;
				que[~i&1][tail[~i&1]++] = nmask;
				mark[nmask] = stamp;
			} else {
				f[~i&1][nmask] = max(f[~i&1][nmask], f[i&1][mask] + 1);
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < 20; ++i) {
		if (mark[1<<i] == stamp) ans = max(ans, f[n&1][1<<i]);
	}
	return ans;
}

void solve()
{
	ans = 0;
	memset(v, 0, sizeof(v));
	for (int i = 0; i < n; ++i) {
		if (v[i]) continue;
		int m = 0;
		for (int j = i; j < n; ++j) {
			if (a[i] == a[j]) c[m++] = b[j], v[j] = true;
		}
		ans = max(ans, dp(c, m));
	}
}

int main()
{
	while (scanf("%d", &n) != EOF && n) {
		init();
		solve();
		printf("%d\n", ans);
	}
}