PROGRAMMING:Fibonacci sequence (III)

Known Fibonacci sequence $$f_{ n} = F_{ n-1} +F_{ n-2}(n>=3), F_ 1 = 1, F_ 2=1$$
The nth term of the sequence is solved, and the result is modular to * * 998244353 * *.
**It is suggested that the maximum value of the fast power of the matrix is 1844674407370955161 (1.8e18)**
###Input format:
Enter a positive integer n $$(1 < = n < = - color {red} {textbf {1e18}) $$.
###Output format:
Output a number, the nth item of the sequence
###Input sample 1:
```in
one
```
###Output sample 1:
```out
one
```
###Input sample 2:
```in
three
```
###Output sample 2:
```out
two
```







answer：If there is no answer, please comment