Aorther Combination Problem

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MOD (1000000007)
#define M(A,B) ((((A)%MOD)*((B)%MOD))%MOD)
ll foo(ll N){
    return (M(M(M(N,N+1),2*N+1),166666668)+M(N,M(N+1,500000004)))%MOD;
}
int main(void){
    ll N;
    IN(tt)F(tt){
        scanf("%lld",&N);
        printf("Case %d: %lld\n",i+1,foo(N));
    }
    return 0;
}