#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int t; cin >> t;
    for (int i = 0; i < t; ++i) {
        printf("Case %d:\n", i+1);
        int x;
        cin >> x;
        for (int j = 0; j < 10; ++j) {
            int nxt = (x*x)/100%10000;
            cout << nxt << "\n";
            x = nxt;
        }
    }

    return 0;
}
