#include <stdio.h>
#include <algorithm>

int main()
{
    int n, z;

    z = 1;
    while (scanf (" %d", &n) != EOF) {
        int p, ct, t, v;

        p = ct = 1;
        t = 0;
        while (n > 0) {
            v = std::min(n, ct);

            n -= v;
            t += v * p;

            ct *= 2;
            p++;
        }

        printf("Case %d: %d\n", z++, t);
    }

    return 0;
}