#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#define MOD 1000000007
using namespace std;
long long ans[1000010];
void init()
{
    ans[0] = 0; ans[1] = 1; ans[2] = 2;
    for( int i=3 ; i<=1000000 ; i++ )
    {
        ans[i] = ( ans[i-1] + ans[i-2] * ( i-1 ) ) % MOD;
    }
    return ;
}
int main()
{
    int T , n;
    init();
    scanf( "%d" , &T );
    for( int cas = 1 ; cas <= T ; cas++ )
    {
        scanf( "%d" , &n );
        printf( "Case #%d:\n%I64d\n" , cas , ans[n] );
    }
    return 0;
}