#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define fi(n) for(i=0;i<n;i++)
#define fj(m) for(j=0;j<m;j++)
#define sca(x) scanf("%d",&x)
#define scalld(x) scanf("%I64d",&x)
#define print(x) printf("%d\n",x)
#define printlld(x) printf("%I64d\n",x)
#define d printf("=======\n")typedef long long ll;
using namespace std;
//const int maxn = 1e6+10;
vector< pair<ll, int> > V;
vector< pair<ll, int> >::iterator it;
void build( ll num ) {ll m = (double)sqrt(num+0.5);
//    cout << m << endl;for( int i = 2; i <= m; i++ ) {int cnt = 0;while( num % i == 0 ) {num /= i;cnt++;}if( cnt != 0 ) {V.push_back(make_pair(i, cnt));}}if( num > 1 ) {V.push_back(make_pair(num, 1));}
}//const int INF = 1e11;
int main() {ll n;int cases = 1;
//    for( int i = 0; i < 12; i++ ) {
//        cout << prime[i] << " ";
//    }
//    cout << endl;//    cout << cnt << endl;
//    freopen("in.txt", "r", stdin );while( cin >> n && n ) {V.clear();if( n == 1 ) {cout << "Case " << cases++ << ": " << 2 << endl; continue; }build(n);int cnt = (int)V.size();double res = 0;for( it = V.begin(); it != V.end(); it++ ) {res += pow( double(it->first), double(it->second) );}if( cnt == 1 ) cout << "Case " << cases++ << ": " << ll(res+1) << endl;else cout << "Case " << cases++ << ": " << ll(res) << endl;}return 0;
}