#include <bits/stdc++.h>

 using namespace std;

 int divide_all(int& n,int d) {

     int x = ;

     while(n%d==) {

         n/=d;

         x*=d;

     }

     return x;

 }

 long long solve(int n) {

     if(n==) return ;

     int m = sqrt(n)+0.5;

     int pf = ;

     long long ans = ;

     for(int i=;i<=m;i++) {

         if(n%i==) {

             pf++;

             ans+=divide_all(n,i);

         }

     }

     if(n>) {pf++,ans+=n;}

     if(pf<=) ans++;    //是素数

     return ans;

 }

 int main()

 {

     int n;

     int kase=;

     while(scanf("%d",&n),n) {

         cout<<"Case "<<kase++<<": "<<solve(n)<<endl;

     }

     return ;

 }