/**
 * Created by Zhenyi Luo on 15-5-23.
 */
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
    public static final int MOD = (int) (1e9 + 7);
    public static long[] dp = new long[1000001];

    static{
        dp[1] = 1;
        dp[2] = 2;
        for(int i = 2; i < 1000000; i++){
            dp[i+1] = (dp[i] + dp[i-1] * (i)) % MOD ;
        }
    }

    private static void solve(Scanner sc, PrintWriter pw) {
        int n = sc.nextInt();
        pw.println(dp[n]);
    }



    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int T = sc.nextInt();
        for(int i = 0; i < T; i++){
            pw.println("Case #" + (i + 1) + ":");
            solve(sc, pw);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}