Summarize to the Power of Two(思维+暴力)

Summarize to the Power of Two

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

).

For example, the following sequences are good:

[5,3,11]

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

.

Note that, by definition, an empty sequence (with a length of 0

) is good.

For example, the following sequences are not good:

[16]

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

such that their sum is a power of two).

You are given a sequence a1,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 n

(1≤n≤120000

) — the length of the given sequence.

The second line contains the sequence of integers a1,a2,…,an
(1≤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 n

elements, make it empty, and thus get a good sequence.

Examples
Input

6
4 7 1 5 4 9

Output

1

Input

5
1 2 3 4 5

Output

2

Input

1
16

Output

1

Input

4
1 1 1 1023

Output

0

Note

In the first example, it is enough to delete one element a4=5

. The remaining elements form the sequence [4,7,1,4,9], which is good.

题意：

给一组数据 ， 如果一个数和其他数相加，不是2的某一次方，那么就删去这个数，统计需要删去的最少个数。

分析：

首先因为我们发现$a_i \le 10^9$ 而 $2^{28} > 10^9$，所以我们可以将2的幂次先预处理出来总共顶多30次，然后将每个数$a_i$存在map中，暴力枚举每个数$a_i$然后枚举每个2的幂次，找到一个大于$a_i$的2的幂次然后相减得到差，看这个差是否在map中存在即看是否存在$a_j$就可以了

注意如果2的幂次减$a_i$后得到的数和$a_i$相同，那么需要判断这个数不是它本身，而应该至少两个这样的数才行

code：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 2e6;
map<ll,ll> m;
ll a[maxn];
int n;
ll d[40];
void init(){
    d[0] = 1;
    for(int i = 1; i <= 31; i++){
        d[i] = d[i-1] * 2;
    }
}
int main(){
    init();
    while(~scanf("%d",&n)){
        m.clear();
        int cnt = 0;
        for(int i = 0; i < n; i++){
            scanf("%lld",&a[i]);
            if(!m.count(a[i])) m[a[i]] = 1;
            else m[a[i]]++;
        }
        for(int i = 0; i < n; i++){
            int j;
            for(j = 0; j <= 30; j++){
                int dif = d[j] - a[i];
                if(dif == a[i]){
                    if(m[dif] >= 2) break;
                }
                else{
                    if(m[dif]) break;
                }
            }
            if(j == 31) cnt++;
        }
        printf("%d\n",cnt);
    }
    return 0;
}