Hex-a-bonacci

#include<bits/stdc++.h>
using namespace std;
long long int x[200000],a, b, c, d, e, f;
long long int fn( long long int n )
{
    if( n == 0 )
        return a;
    if( n == 1 )
        return b;
    if( n == 2 )
        return c;
    if( n == 3 )
        return d;
    if( n == 4 )
        return e;
    if( n == 5 )
        return f;
    else
    {
        x[n]=(fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6))%10000007;
        return x[n];
    }
}
int main()
{
    long long int n,i,cases;
    scanf("%lld",&cases);
    for(i=1; i<=cases; i++)
    {
        scanf("%lld %lld %lld %lld %lld %lld %lld", &a, &b, &c, &d, &e, &f, &n);
        printf("Case %lld: %lld\n",i,fn(n)%10000007);
    }
    return 0;
}