CF914G Sum the Fibonacci
Description
You are given an array $ s $ of $ n $ non-negative integers.
A 5-tuple of integers $ (a,b,c,d,e) $ is said to be valid if it satisfies the following conditions:
- $ 1
Input Format
The first line of input contains an integer $ n $ ( $ 1
Output Format
Output the sum as described above, modulo $ 10^{9}+7 $