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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
	
	static List<Long> list = new ArrayList<>();
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.nextLine());
		long[] num = Arrays.stream(sc.nextLine().split(" ")).mapToLong(Long::parseLong).toArray();
		for (long l : num) {
			list.add(l);
		}
		System.out.println(getMax(list));
		
	}
	
	public static long getMax(List<Long> li) {
		long c = 0;
		
		for(int i=0; i<li.size()-1; i++) {
			long max = 0;
			for(int j = i+1; j<li.size(); j++) {
				long v = li.get(i) + li.get(j);
				if((v & (v-1)) == 0) {
					long m = 1 + getMax(sublist(i,j,li));
					System.out.println(sublist(i,j,li));
					max = Math.max(max, m);
				}
			}
			c = Math.max(max, c);
		}
		return c;
		
	}
	
	public static List<Long> sublist(int i, int j, List<Long> l){
		ArrayList<Long> tmp = new ArrayList<>();
		for (long a : l) {
			tmp.add(a);
		}
		tmp.remove(i);
		tmp.remove(j-1);
		return tmp;
	}

}