Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,2]1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,2] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)
x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x)