Submit solution
Points:
20
Time limit:
0.3s
Memory limit:
64M
Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
is not feeling well today, and has decided to create a more painful version of the
Recall that the Fibonacci sequence is a well known sequence of numbers in which
You are given a number
, find the
Fibonacci number, modulo
.
Input Specification
The first line of input will have the number .
Output Specification
The Fibonacci number, modulo
.
Sample Input
26
Sample Output
121393
Comments
This comment is hidden due to too much negative feedback. Click here to view it.
Use math.