Summarize to the Power of Two（map+思维）

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

6
4 7 1 5 4 9

output

1

input

5
1 2 3 4 5

output

Copy

2

input

1
16

output

1

input

4
1 1 1 1023

output

0

Note

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

题目意思：给你一个数列，然后让你删掉某个数，让每一个数都可以与另外一个数相加，之和等于2的^d次方，问最少删掉的个数

解题思路：先预处理出2的次幂，然后暴力枚举出每个数与每个2的次幂之差，去判断在map中是否有这样的差存在（注意相同的两个数，比如4 ，4   这个时候就可以特判一下，出现次数），若不存在那么就需要删除掉这个数。

 #include<cstdio>
 #include<cstring>
 #include<map>
 #include<algorithm>
 #define ll long long int
 using namespace std;
 ll d[];
 ll a[];
 map<ll,ll>mp;
 void double_2()
 {
     int i;
     d[]=;
     for(i=; i<=; i++)
     {
         d[i]=d[i-]*;
     }
 }
 int main()
 {
     int i,j,flag,n;
     ll k;
     double_2();///2的幂
     while(scanf("%d",&n)!=EOF)
     {
         int count=;
         mp.clear();///map清零
         for(i=; i<n; i++)
         {
             scanf("%lld",&a[i]);
             mp[a[i]]++;///记录出现的次数
         }
         for(i=; i<n; i++)
         {
             flag=;
             for(j=; j<=; j++)
             {
                 if(a[i]>=d[j])
                 {
                     continue;
                 }
                 else
                 {
                     k=d[j]-a[i];
                     if(mp[k])///map中存在
                     {
                         if(a[i]==k)
                         {
                             if(mp[k]>=)///map中需要至少两个
                             {
                                 flag=;
                                 break;
                             }
                         }
                         else
                         {
                             flag=;
                             break;
                         }
                     }
                 }
             }
             if(!flag)
             {
                 count++;
             }
         }
         printf("%d\n",count);
     }
     return ;
 }