hex a bonacci

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int n, caseno = 0, cases, res, a, b, c, d, e, f;
    scanf("%d", &cases);
    while( cases-- ){
        scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &n);
        if(n > 5){
            n -= 5;
            while(n--){
                res = (a%10000007 + b%10000007 + c%10000007 + d%10000007 + e%10000007 + f%10000007)%10000007;
                a = b;
                b = c;
                c = d;
                d = e;
                e = f;
                f = res;
            }
        }
        else{
            if( n == 0 ) res = a;
            if( n == 1 ) res = b;
            if( n == 2 ) res = c;
            if( n == 3 ) res = d;
            if( n == 4 ) res = e;
            if( n == 5 ) res = f;
        }
        printf("Case %d: %d\n", ++caseno, res % 10000007);
    }
    return 0;
}