Fibonachchi sonining raqami

Fibonachchi sonlari: $F_1 = 1$, $F_2 = 1$, $F_k = F_{k-1} + F_{k-2}$. Ya'ni $1, 1, 2, 3, 5, 8, 13, \ldots$

Natural son $n$ berilgan ($n \ge 2$). Agar $n$ Fibonachchi soni bo'lsa, uning tartib raqami $k$ ni ($n = F_k$) chiqaring, aks holda $0$.

Bitta butun son $n$ ($2 \le n \le 10^{18}$).

Bitta butun son — $k$ yoki $0$.

Fibonachchi sonlarini ketma-ket hosil qiling, joriy son $n$ dan kichik ekan — while. To'xtaganda joriy son $n$ ga teng bo'lsa — topildi. Birinchi misolda: $13 = F_7$; $7$ esa $5$ va $8$ orasida, javob $0$.

$10^{18}$ gacha bo'lgan sonlar uchun long long / int64 kerak.