Create a program of the square picking method, which is one of the classical random number generation methods. The square harvesting method was proposed by von Neumann in the mid-1940s.

In the square picking method, when the number of digits of the generated random number is n, the square of the initial value s is calculated, and the value is regarded as a 2n digit number (the number of squared digits as shown in the example below). If is not enough, make up for 0.) Let the n numbers in the center be the first random number. Then square this random number and take the n numbers in the center in the same way to get the next random number. For example, if 123 is the initial value


1232 = 00015129 → 0151
1512 = 00022801 → 0228
2282 = 00051984 → 0519
5192 = 00269361 → 2693
26932 = 07252249 → 2522


It will be like. Use this method to create a program that takes the initial value s (a positive integer less than 10000) as an input and generates and outputs 10 random numbers when n = 4.



Input

Given multiple datasets. The first line gives the number of datasets d (d ≤ 10). For each dataset, one row is given the initial value s (integer, 1 ≤ s <10000).

Output

For each dataset


Case x: (x is a dataset number starting with 1)
The first generated random number (integer)
The second generated random number (integer)
:
:
10th generated random number (integer)


Please output.

Example

Input

2
123
567


Output

Case 1:
151
228
519
2693
2522
3604
9888
7725
6756
6435
Case 2:
3214
3297
8702
7248
5335
4622
3628
1623
6341
2082
#include <bits/stdc++.h>

using namespace std;

int const RSIZE = 4;

string toStr(int x) {
  stringstream ss; ss << x;
  return ss.str();
}

int toInt(string s) {
  stringstream ss(s);
  int x; ss>>x;
  return x;
}

int change(int n) {
  
  int res = 0;
  int get = n*n;
  string s = toStr(get); int const ssize = s.size();
  string t;
  for(int i=0; i<2*RSIZE; i++) {
    if(ssize-1-i>=0) {
      t = s[ssize-1-i] + t;
    }
    else {
      t = '0' + t;
    }
  }
  
  string pre;
  for(int i=2; i<6; i++) {
    pre += t[i];
  }
  
  return toInt(pre);
}

int main() {
  int Tc; cin >> Tc;
  
  for(int T = 1; T <= Tc; T++) {
    cout << "Case " << T << ":" << endl;
    
    int N; cin >> N;
    
    int n = N;
    for(int i=0; i<10; i++) {
      n = change(n);
      cout << n << endl;
    }
  }
  
  return 0;
}