1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll H(int n) {
    ll res = 0;
    for (ll i = 1, j; i <= n; i = j + 1)
    {
        j = n / (n / i);
        res += (ll)(n / i) * (j - i + 1);
    }
    return res;
}

int main() {
    int T; cin >> T;
    for (int t = 1; t <= T; t++)
    {
        int n; cin >> n;
        printf("Case %d: %lld\n", t, H(n));
    }
    return 0;
}