#82 Array and Counting 1

Statement

Statement language

A positive integer $N$ and a sequence $A = [A_1, A_2, \cdots, A_{2N}]$ of length $2N$ are given. Find the number of integer pairs $(i, j)$ that satisfy the following conditions.

$1 \leq i \leq N$ .
$1 \leq j \leq N$ .
$A_i + A_j = A_{i + j}$ .

Input

The input is given in the following format.

$N$ $A_1 \ A_2 \ \cdots \ A_{2N}$

Output

Print the answer of the problem on the first line.

Constraints

$1 \leq N \leq 2 \ 000$ .
$1 \leq A_i \leq 1 \ 000 \ 000 \ 000$ ().

Subtasks

#	Score	Constraints
1	37	$N \leq 200$ .
2	63	No additional constraints.

Samples

Sample 1

Input

3
1 2 3 7 5 10

Output

5

Sample 2

Input

4
1 2 3 4 5 6 7 8

Output

16