#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = , INF = 0x7fffffff;

int sum[maxn];

void init()

{

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

    {

        for(int j=; j<=i; j++)

        {

            if(i % j) continue;

            sum[i] += j;

        }

    }

}

int main()

{

    int n, kase = ;

    init();

    while(cin>> n && n)

    {

        int ok = ;

        if(n == )

        {

            printf("Case %d: %d\n",++kase, );

            continue;

        }

        for(int i=; i>=; i--)

        {

            if(sum[i] == n)

            {

                ok = ;

                printf("Case %d: %d\n",++kase, i);

                break;

            }

        }

        if(ok) printf("Case %d: %d\n",++kase, -);

    }

    return ;

}