Fibonacci Number

Problem Statement As we know, Fibonacci Number is defined as Fn=n if n ≤ 1 Fn=Fn-1+Fn-2, otherwise Now this problem is quite simple: you are given one prime number P and one non-negative integer C You are expected to find the smallest non-negative integer n, such that Fn≡C(mod P) The definition of "mod" could be found here: here Input The first line of the input contains an