#include <iostream>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <functional>
#define lowbit(x) (x&(-x))
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
#define PI acos(-1.0)
#define fir first
#define sec second
#define inf 0x3f3f3f3f
#define E 2.7182818284590452353602874713527
using namespace std;
/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
/********************************Head----Template**********************************************/
// dp pos sum mod
// 搜索到第pos位 dp到当前数位中路径数位和 取模之后的结果 ;得用两个数确定一个状态
ll dp[20][200][200];
int num[20],mod;
ll dfs(int len,int sum,int sta,bool limit){//目前枚举的位数,各位和,取余mod的余数,限制
if(len==0) return sum==mod&&sta==0;//各位和相同,且刚好能除尽
if(dp[len][sum][sta]!=-1&&!limit) return dp[len][sum][sta];//存储的是一个不加限制的完整的dp
int maxx=limit?num[len]:9;
ll ret=0;
for(int i=0;i<=maxx;i++){
if(i+sum>mod) break;//当前数位和大于mod 不可取
ret+=dfs(len-1,sum+i,(sta*10+i)%mod,limit&&i==maxx);//当前位置有限制且已经枚举到最高位,那么对下一位就存在限制;
}
return limit?ret:dp[len][sum][sta]=ret;
}
ll solve(ll n){
int len=0;
memset(num,0,sizeof(num));
while(n) num[++len]=n%10,n/=10;
ll ans=0;
for(int i=1;i<=9*len;i++) {//枚举每一种数位和表示为mod,寻找当前区间内存在多少个数是mod的倍数.
memset(dp,-1,sizeof(dp));
mod=i,ans+=dfs(len,0,0,1);
}
return ans;
}
int main (){
int t;cin>>t;
for(int cas=1;cas<=t;cas++){
ll n;cin>>n;
cout<<"Case "<<cas<<": "<<solve(n)<<endl;
}
return 0;
}