Given f(0)=1, f(1)=1 and f(n) = (f(n-1) + f(n-2) + (n/4)) mod (10^9+7), compute the nth "fenis number".
Asked in the online assessment stage. It was the single coding question in the OA, followed by MCQ sections.
Implement fenis_number(n). Use integer division for n/4, so the recurrence adds n // 4.
n is a non-negative integer. Return f(n) as an integer.
def fenis_number(n):