codeforces #496-C Summarize to the Power of Two

                                                                C. Summarize to the Power of Two

A sequence a1,a2,…,ana1,a2,…,an is called good if, for each element aiai, there exists an element ajaj (i≠ji≠j) such that ai+ajai+aj is a power of two (that is, 2d2d for some non-negative integer dd).

For example, the following sequences are good:

• [5,3,11][5,3,11] (for example, for a1=5a1=5 we can choose a2=3a2=3. Note that their sum is a power of two. Similarly, such an element can be found for a2a2 and a3a3),
• [1,1,1,1023][1,1,1,1023],
• [7,39,89,25,89][7,39,89,25,89],
• [][].

Note that, by definition, an empty sequence (with a length of 00) is good.

For example, the following sequences are not good:

• [16][16] (for a1=16a1=16, it is impossible to find another element ajaj such that their sum is a power of two),
• [4,16][4,16] (for a1=4a1=4, it is impossible to find another element ajaj such that their sum is a power of two),
• [1,3,2,8,8,8][1,3,2,8,8,8] (for a3=2a3=2, it is impossible to find another element ajaj such that their sum is a power of two).

You are given a sequence a1,a2,…,ana1,a2,…,an. What is the minimum number of elements you need to remove to make it good? You can delete an arbitrary set of elements.

Input

The first line contains the integer nn (1≤n≤1200001≤n≤120000) — the length of the given sequence.

The second line contains the sequence of integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109).

Output

Print the minimum number of elements needed to be removed from the given sequence in order to make it good. It is possible that you need to delete all nn elements, make it empty, and thus get a good sequence.

Examples

input

Copy

6
4 7 1 5 4 9

output

Copy

1

input

Copy

5
1 2 3 4 5

output

Copy

2

input

Copy

1
16

output

Copy

1

input

Copy

4
1 1 1 1023

output

Copy

0

Note

In the first example, it is enough to delete one element a4=5a4=5. The remaining elements form the sequence [4,7,1,4,9][4,7,1,4,9], which is good.

思路：

暴力直接搞

代码：

#include<cstdio>
#include<map>
#define maxn 120000
using namespace std;
int num[maxn + 5],p[32];
int main() 
{
    int i,n,j,ans = 0;
    for (i = 0;i <= 30;i ++) p[i] = 1 << i;
    scanf("%d",&n);
    map<int,int> m;
//    m.clear();
    for (i = 0;i < n;i ++)
    {
        scanf("%d",&num[i]);
        if (!m.count(num[i])) m[num[i]] = 1;
        else m[num[i]] ++;
    }
    for (i = 0;i < n;i ++)
    {
        for (j = 0;j <= 30;j ++)
        {
            int temp = p[j] - num[i];
            if (temp == num[i])
            {
                if (m[temp] >= 2) break;
            }
            else 
            {
                if (m[temp]) break;
            }
        }
        if (j == 31) ans ++;
    }
    printf("%d\n",ans);
    return 0;
}