uva1645

/**********
author:chanjun2016
email:15755396353@163.com
***********/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>

using namespace std;

#define INF = 0x3f3f3f3f

int MOD = 1e9 + 7;

int f[1001];

int main(){
	
	f[1] = 1, f[2] = 1, f[3] = 2;
	for (int i = 4; i <= 1000; ++i){
		for (int j = 1; j <= i; ++j){
			int r = (i - 1) % j;
			if (r == 0){
				f[i] = (f[i] + f[(i - 1) / j]) % MOD;
			}
		}
	}

	int kase = 0,n;
	while (~scanf("%d",&n)){
		printf("Case %d: %d\n",++kase,f[n]);
	}

	return 0;
}