import
java.util.*;
import
java.lang.*;
class
GFG
{
static
int
previousFibonacci(
int
n)
{
double
a = n / ((
1
+ (
int
)Math.sqrt(
5
)) /
2.0
);
return
(
int
)Math.round(a);
}
static
int
nextFibonacci(
int
n)
{
double
a = n * (
1
+ (
int
)Math.sqrt(
5
)) /
2.0
;
return
(
int
)Math.round(a);
}
static
boolean
isPerfectSquare(
int
x)
{
int
s = (
int
)Math.sqrt(x);
return
(s * s == x);
}
static
boolean
isFibonacci(
int
n)
{
return
(isPerfectSquare(
5
* n * n +
4
)
|| isPerfectSquare(
5
* n * n -
4
));
}
static
int
countFibonacciPairs(
int
arr[],
int
n)
{
int
res =
0
;
for
(
int
i =
0
; i < n; i++)
for
(
int
j = i +
1
; j < n; j++)
if
(isFibonacci(arr[i])
&& isFibonacci(arr[j])) {
int
prevFib = previousFibonacci(arr[i]);
int
nextFib = nextFibonacci(arr[i]);
if
(prevFib == arr[j]
|| nextFib == arr[j]) {
res++;
}
}
return
res;
}
public
static
void
main(String []args)
{
int
[]a = {
3
,
5
,
8
,
11
};
int
n = a.length;
System.out.print(countFibonacciPairs(a, n));
}
}