PROGRAMMING:Finding Fibonacci numbers satisfying conditions

Fibonacci number, also known as Fibonacci sequence, refers to such a sequence: 1, 1, 2, 3, 5, 8, 13, 21,..., which starts from the third term, and each term is equal to the sum of the first two terms. Find the minimum Fibonacci number greater than the input number.
###Input format:
Enter a positive integer n (n > = 10) on a line.
###Output format:
Output the minimum Fibonacci number greater than N on one line.
###Input example:
Here is a set of inputs. For example:
```in
ten
```
###Output example:
The corresponding output is given here. For example:
```out
thirteen
```







answer：If there is no answer, please comment
```
n=int(input())
pre=1
cur=1
while cur<=n:
pre,cur=cur,pre+cur
print(cur)
```