1077_E. Thematic Contests
Polycarp has prepared n competitive programming problems. The topic of the i-th problem is a_i, and some problems' topics may coincide.

Polycarp has to host several thematic contests. All problems in each contest should have the same topic, and all contests should have pairwise distinct topics. He may not use all the problems. It is possible that there are no contests for some topics.

Polycarp wants to host competitions on consecutive days, one contest per day. Polycarp wants to host a set of contests in such a way that:

  * number of problems in each contest is exactly twice as much as in the previous contest (one day ago), the first contest can contain arbitrary number of problems; 
  * the total number of problems in all the contests should be maximized. 



Your task is to calculate the maximum number of problems in the set of thematic contests. Note, that you should not maximize the number of contests.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of problems Polycarp has prepared.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) where a_i is the topic of the i-th problem.

Output

Print one integer — the maximum number of problems in the set of thematic contests.

Examples

Input


18
2 1 2 10 2 10 10 2 2 1 10 10 10 10 1 1 10 10


Output


14


Input


10
6 6 6 3 6 1000000000 3 3 6 6


Output


9


Input


3
1337 1337 1337


Output


3

Note

In the first example the optimal sequence of contests is: 2 problems of the topic 1, 4 problems of the topic 2, 8 problems of the topic 10.

In the second example the optimal sequence of contests is: 3 problems of the topic 3, 6 problems of the topic 6.

In the third example you can take all the problems with the topic 1337 (the number of such problems is 3 so the answer is 3) and host a single contest.
```python
# from collections import Counter as C
# n, k_ = map(int, input().split())
# l = [*map(int, input().split())]

# c = C(l)
# d = {}
# for k, v in c.items():
#     d[v] = d.get(v, []) + [str(k)]

# ld = sorted([(k, v) for k, v in d.items()], reverse = True)

# res = []
# # print(ld)
# for e in ld:
#     res += [e[1]]
#     if e[0] * len(res) >= k_:
#         i = 0
#         while k_ > e[0] * len(res[i]):
#             print((' '.join(res[i]) + ' ') * e[0])
#             i += 1
#             k_ -= e[0] * len(res[i])
#         # if k_:
#         #     print((res[i] + ' ') * k_)
#         exit(0)


from bisect import bisect_left, bisect_right
from collections import Counter as C

n_ = int(input())
l = sorted(C(map(int, input().split())).values())
n = len(l)
i = res = 0

# print(l)

def f(x):
    i = 0
    for m in range(33):
        t = x << m
        i = bisect_left(l, t, i)
        if i == n:
            return t - x
        i += 1


res = 0
for x in range(1, n_ + 1):
    res = max(res, f(x))

print(res)
```