Div3 codefores1005C 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.
题解
一个数a[ i ]，如果找不到其他任何一个a[ j ]与它相加等于2的幂，就把这个a[ i ]删除，求总共需要删除几个数。

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#define lson l,m,i << 1
#define rson m+1,r,i << 1 | 1
#define MAX 0x3f3f3f3f
const int MAXN = 2e5+10;
using namespace std;
typedef long long LL;
map<int,int>m;        
LL a[33];             //存2的幂
LL b[211111];         
int main()
{
    a[0]=1;
    for(int i=1;i<=31;i++)
        a[i]=a[i-1]*2;
    int n;
    cin >> n;
    for(int i=0;i<n;i++)
    {
        cin >> b[i];
        m[b[i]]++;
    }
    int ans=0,j;
    for(int i=0;i<n;i++)
    {
        for( j=0;j<=31;j++)
        {
            if(a[j]>b[i])
            {
                if(m[a[j]-b[i]]!=0)
                {
                    if(a[j]==2*b[i])
                    {
                          if(m[b[i]]>=2)
                            break;
                    }
                    else
                        break;
                }

            }
        }
        if(j>31)
            ans++;
    }
    cout <<ans<<endl;
    return 0;
}