#Fibonacci
fn = [0,1]
for n in range(2,51):
    fn.append(fn[n - 2] + fn[n - 1])

#print(fn)
print(fn[50])

#prime_number
prime = [2]
#for文
n = 1 #配列に元々入れてある一個目の素数”2”の分の1
for i in range(3,10000):#1000個目の素数が10000以下の自然数であることを予め知っている書き方なので×
    if n == 1000:
        break
    else:
        for l in range(2,i):
            x = i % l
            if x == 0:
                break
            elif l == i - 1:
                prime.append(i)
                n = n + 1

print(str(prime[n - 1]) + " is a " + str(n) + "th prime number")
#print(prime)


#while文
n = 1
i = 3
while n < 1000:
    for l in range(2,i):
        x = i % l
        if x == 0:
            break
        elif l == i - 1:
            prime.append(i)
            n = n + 1
    i = i + 1

print(str(prime[n - 1]) + " is a " + str(n) + "th prime number")
#print(prime)