#include <cmath>#include <stack>#include <cstdio>using namespace std;int main(){ int re; int r, i, xr, xi, br, bi, bb, b, a; scanf("%d", &re); while (re--) { scanf("%d%d%d%d", &xr, ξ, &br, &bi); bb = br * br + bi * bi; b = (int)(sqrt((double)bb) - 1e-6); stack<int> ans; do { for (a = 0; a <= b; a++) { r = (xr - a) * br - xi * (-bi); i = (xr - a) * (-bi) + xi * br; if (r % bb == 0 && i % bb == 0) { xr = r / bb; xi = i / bb; ans.push(a); break; } } if (a > b || ans.size() > 100) { break; } } while (xr != 0 || xi != 0); if (xr != 0 || xi != 0) { puts("The pre cannot be decrypted."); } else { while(!ans.empty()) { printf("%d", ans.top()); ans.pop(); putchar(ans.empty() ? 'n' : ','); } } } return 0;}
