Preparando MOJI

Powers of Two

3000ms 262144K

Description:

You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x).

Input:

The first line contains the single positive integer n (1 ≤ n ≤ 105) — the number of integers.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output:

Print the number of pairs of indexes i, j (i < j) that ai + aj is a power of 2.

Sample Input:

4
7 3 2 1

Sample Output:

2

Sample Input:

3
1 1 1

Sample Output:

3

Note:

In the first example the following pairs of indexes include in answer: (1, 4) and (2, 4).

In the second example all pairs of indexes (i, j) (where i < j) include in answer.

Informação

Codeforces

Provedor Codeforces

Código CF702B

Tags

brute forcedata structuresimplementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:08:11

Relacionados

Nada ainda