#include <cstdio>

#include <iostream>

#include <ctime>

#include <vector>

#include <cmath>

#include <map>

#include <queue>

#include <algorithm>

#include <cstring>

using namespace std;

typedef long long LL;

const int N=1e7+;

const int INF=0x3f3f3f3f;

int cnt;

bool v[N];

LL prime[];

void getprime(){

  for(int i=;i*i<=N-;++i)

    if(!v[i])

      for(int j=i*i;j<=N-;j+=i)

        v[j]=;

  for(int i=;i<=N-;++i)

  if(!v[i])prime[++cnt]=i;

}

int ans;

vector<LL>g,c;

bool vis[];

void dfs(int pos,LL res){

  if(pos==g.size()){

    int tmp=;

    for(int i=;i<g.size();++i){

      if(vis[i])continue;

      tmp*=(c[i]+);

    }

    ans+=tmp;

    return;

  }

  dfs(pos+,res);

  vis[pos]=;

  for(LL i=,k=g[pos];i<=c[pos];++i,k*=g[pos])

    dfs(pos+,res*k);

  vis[pos]=;

  return;

}

int main()

{

    getprime();

    int cas=,T;

    scanf("%d",&T);

    while(T--){

      LL t,n;

      scanf("%lld",&n),t=n;

      g.clear(),c.clear();

      for(int i=;i<=cnt&&prime[i]*prime[i]<=t;++i){

          if(t%prime[i])continue;

          int tot=;

          g.push_back(prime[i]);

          while(t%prime[i]==)t/=prime[i],++tot;

          c.push_back(tot);

      }

      if(t>)g.push_back(t),c.push_back();

      ans=;

      dfs(,);

      printf("Case %d: %d\n",++cas,(ans>>)+);

    }

    return ;

}