How to calculate the fibonacci entry point for N numbers p₁, p₂, p₃, ...., p_n. (1 <  = p_i <  = 10⁹)

FEP(p_i) = j such that j^th fibonacci number is the first fibonacci number F_j divisible by p_i

How can we find it efficiently for N numbers.

Ex,
input = 2, output = 3
input = 5, output = 5
input = 13, output = 7