#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

typedef long long LL;

const int MAXN = 1e6+;

const int MOD = 1e9+;

LL C[MAXN];

LL QuickPow(LL x, LL n)

{

    LL ans = ;

    while(n) {

        if(n & ) ans = (ans * x) % MOD;

        x = (x * x) % MOD;

        n /= ;

    }

    return ans;

}

void Pre()

{

    C[] =  ;

    for(int i = ; i <= MAXN; i++) {

        C[i] = C[i-] * ( * i - ) % MOD * QuickPow(i + , MOD-) % MOD;

    }

}

int main()

{

    Pre();

    int t;

    int n;

    scanf("%d", &t);

    for(int cas = ; cas <= t; cas++) {

        scanf("%d", &n);

        printf("Case #%d:\n%I64d\n", cas, C[n]);

    }

    return ;

}