#include <bits/stdc++.h>
using namespace std;

int main() {
    int kase = 1, N;
    while(cin >> N && N != 0) {
        cout << "Case " << kase++ << ": ";
        long long sum = N + 1; // 初始化为最大可能值
        for(int i = (int)sqrt(N); i >= 1; i--) {
            if(N % i == 0) {
                int j = N / i;
                if(__gcd(i, j) == 1) { // 确保i和j互质
                    sum = i + j;
                    break;
                }
            }
        }
        cout << sum << endl;
    }
    return 0;
}