UVA12169DisgruntledJudge

//UVA12169Disgruntled Judge
#include<cstdio>
#include<cstring>
const int maxt = 100 + 5;
const int M = 10001;
int T, f[maxt * 2];
void solve() {
	for(int a = 0; a < M; a++) 
		for(int b = 0; b < M; b++) {
	        bool ok = true;
	        for(int k = 2; k <= 2 * T; k += 2) {
	        	f[k] = (a * f[k - 1] + b) % M;
	        	if(k + 1 <= 2 * T - 1 && f[k + 1] != (a * f[k] + b) % M) { ok = false; break; }
			}
			if(ok) return ;
		}
}

int main() {
	while(scanf("%d", &T) == 1) {
		for(int i = 1; i <= T * 2 - 1; i += 2) scanf("%d", &f[i]);
		solve();
		for(int i = 2; i <= 2 * T; i += 2) printf("%d\n", f[i]);
	}
	return 0;
}
/*
3
17
822
3014
*/