Problem:
Score : 600 points

Problem Statement

Takahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.
He would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.
Note that a ball cannot belong to multiple pairs.
Find the maximum possible number of pairs that can be formed.

Here, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.

Constraints

1 \leq N \leq 2\times 10^5

1 \leq A_i \leq 10^9

A_i is an integer.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.

Sample Input 1

3
1 2 3

Sample Output 1

1

We can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.
Note that we cannot pair the second ball with itself.

Sample Input 2

5
3 11 14 5 13

Sample Output 2

2

Solution in Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

def beki(n)
  # n より大きい、最小の2べき数を見つける
  # 1 -> 2     0001 ->  0010
  # 2 -> 4     0010 ->  0100
  # 3 -> 4     0011
  # 4 -> 8     0100 ->  1000
  # 5 -> 8     0101
  # 6 -> 8     0110
  # 7 -> 8     0111
  # 8 -> 16    1000 -> 10000
  # 15 -> 16   1111 -> 10000
  # 16 -> 32  10000 ->100000

  # 最上位ビットの位置
  pos = n.bit_length

  1 << pos
end

def main
  n = gets.chomp.to_i

  nums = gets.split.map(&:to_i)
  nums.sort!
  nums.reverse!
  # puts nums

  ans = 0
  while 1 < nums.length
    # 大きい方からxを取り出す（remove）
    x = nums.delete_at(0)

    # x に対する相方yを探す
    #   x < x + y <= 2x
    # を満たす2べきは1つしかない
    b = beki(x)
    y = b - x

    y_idx = nums.find_index(y)
    if y_idx
      # 相方yがnumsに見つかったら y もremove
      nums.delete_at(y_idx)
      ans += 1
    end
  end
  puts ans
end

if __FILE__ == $0
  main
end