# given two integer n and k.find position the n\'th multiple of k in the fibonacci.

def findposition(k,n):
    f1=0
    f2=1
    i=2
    while i!=0:
        f3=f1+f2
        f1=f2
        f2=f3

        if f2%k==0:
            return n*i
        i+=1
    return
n=5
k=4
print("Position of n\'th multiple of k in"
"fibonacci Series is",findposition(n,k))