E. Tribonacci numberstime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputTribonacci numbers are a sequence of numbers, defined as follows: t0 = t1 = 0, t2 = 1, ti = ti - 1 + ti - 2 + ti - 3.You are given n; calculate n-th tribonacci number modulo 26.InputThe only line of input contains an integer n (1 ≤ n ≤ 1000).OutputOutput n-th tribonacci number modulo 26.ExamplesInput4Output2Input9Output18
Input4
Output2
['*special problem', '*1600']