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.

Examples

Input

3
1 2 3


Output

1


Input

5
3 11 14 5 13


Output

2
import java.util.*;
import java.lang.*;


public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        TreeMap<Long, Integer> tm = new TreeMap<Long, Integer>();
        for (int i = 0; i < n; i++) {
            long tmp = sc.nextLong();
            if (tm.containsKey(tmp)) {
                tm.put(tmp, tm.get(tmp) + 1);
            } else {
                tm.put(tmp, 1);
            }
        }

        int count = 0;
        while (!tm.isEmpty()) {
            long req = 0;
            for (int j = 0; j < 33; j++) {
                if (Math.pow(2, j) > tm.lastKey()) {
                    req = (long)Math.pow(2, j) - tm.lastKey();
                    break;
                }
            }
            if (tm.get(tm.lastKey()) == 1) {
                tm.remove(tm.lastKey());
            } else {
                tm.put(tm.lastKey(), tm.get(tm.lastKey()) - 1);
            }
            if (tm.containsKey(req)) {
                if (tm.get(req) == 1) {
                    tm.remove(req);
                } else {
                    tm.put(req, tm.get(req) - 1);
                }
                count++;
            }
        }
        System.out.println(count);
    }
}
