"use strict";

var prod = 5895;
var rezult = findFib(prod);
alert(rezult);

function findFib(arg){
	const fi = (1 + Math.sqrt(5)) / 2;
	var rightBine = findBine(arg);
	var n = 0;
	var newFi = fi;

	while(newFi < rightBine){
		n++;
		newFi*=fi;
	}

	var res = fib(n) * fib(n + 1);

	if(res == arg) return [fib(n), fib(n + 1), true];
	else if (res > arg) return [fib(n), fib(n + 1), false];
	else return [fib(n + 1), fib(n + 2), false]
	//return((fib(n) * fib(n + 1)) == arg )? [fib(n), fib(n + 1), true]: [fib(n), fib(n + 1), false];
}


function fib(n) {
  return n <= 1 ? n : fib(n - 1) + fib(n - 2);
}

function findBine(arg){
	return Math.sqrt(arg) * Math.sqrt(5);
}