def fibonacci():
    """a generator for Fibonacci numbers, goes to next number in series on each call"""
    a, b = 0, 1
    while True:
        yield a
        a, b = b, a + b

def pandigital (s):
    if '0' in s:
        return False
    t={}
    for i in s:
        t[i]=1
    if len(s)==len(t):
        #print (s)
        #print (t)
        return True
    return False

f = fibonacci()
#print (type(f))
#print (next(f))
sum=0
i=0
while True:
    n=next(f)
    #print ("i=%d n=%d" % (i, n))
    #if i==541:
    #    s=str(n)
    #    print (len(s))
    #    print (s[-9:])
    #    break
    #if i==2749:
    #    s=str(n)
    #    print (len(s))
    #    print (s[:9])
    #    break
    
    #print ("i=%d" % i)
    
    if n>1000000000:
        if pandigital(str (n % 1000000000)):
    
            s=str(n)

            #if pandigital(s[-9:]):
            #    print (n)
            #    print ("yes! i=%d" % i)
            #    break
        
            #if pandigital(s[:9]):
            #    print (n)
            #    print ("yes! i=%d" % i)
            #    break
        
            #if pandigital(s[:9]) and pandigital(s[-9:]):
            if pandigital(s[:9]):
            #if True:
                #print (n)
                print ("yes! i=%d" % i)
                break
    i=i+1