uva 1645

#include<cstdio>
using namespace std;
const int MOD = 1e9 + 7;
int dp[1010];
int main(){
	int t = 1,n;
	dp[1] = 1;
	for(int i = 2;i < 1001;i++){
		for(int j = 1;j < i;j++){
			if((i - 1) % j == 0){
				dp[i] = (dp[i] + dp[j]) % MOD;
			}
		}
	}
	while(scanf("%d",&n) == 1){
		printf("Case %d: %d\n",t++,dp[n]);
	}
}