Problems

# How many Fibonacci numbers

# How many Fibonacci numbers

Fibonacci sequence is a sequence where each element equals to the sum of two previous ones, except for the first two elements: `F`

= _{1}**1**, `F`

= _{2}**1**, `F`

= _{n}`F`

+ _{n-2}`F`

._{n-1}

**1 1 2 3 5 8 13 21 ...**

Given array of integers. How many Fibonacci numbers are there?

#### Input

The first line contains the amount **k** of input numbers. The next line contains **k** integers `a`

, _{1}`a`

, ..., _{2}`a`

(_{k}**0** < **k** ≤ **1000**, **0** ≤ `a`

< _{i}`2`

).^{63}

#### Output

Print a single number - how many Fibonacci numbers in the given array of integers.

Input example #1

5 1 3 5 6 13

Output example #1

4