Three ones#263
Compute the number of sequences of length , consisting only of zeros and ones, where there are no three consecutive ones.
One integer n~(1 \le n \le 10^5) is given — the length of the sequence.
Print the number of such sequences modulo .
Example 1
Example 2