{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\r\n\t\u003cspan style\u003d\"float:right\"\u003e\u003ca href\u003d\"http://uva.onlinejudge.org/external/108/10879.pdf\" target\u003d\"_blank\"\u003e\u003cimg alt\u003d\"Download as PDF\" border\u003d\"0\" height\u003d\"26\" src\u003d\"http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png\" title\u003d\"Download as PDF\" width\u003d\"100\" /\u003e\u003c/a\u003e\u003c/span\u003e\u003c/p\u003e\r\n\u003cdiv style\u003d\"clear:both\"\u003e\r\n\t\u0026nbsp;\u003c/div\u003e\r\n\u003cp\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003e \u003c/basefont\u003e\u003c/p\u003e\r\n\u003cp\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003e\u003c/basefont\u003e\u003c/p\u003e\r\n\u003ccenter\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003eProblem B\u003cbr /\u003e\r\n\tCode Refactoring\u003cbr /\u003e\r\n\tTime Limit: 2 seconds\u003c/basefont\u003e\u003c/center\u003e\r\n\u003cp align\u003d\"right\"\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003e\u0026nbsp;\u003c/basefont\u003e\u003c/p\u003e\r\n\u003ctable border\u003d\"0\"\u003e\r\n\t\u003ctbody\u003e\r\n\t\t\u003ctr\u003e\r\n\t\t\t\u003ctd\u003e\r\n\t\t\t\t\u003cbasefont face\u003d\"ARIAL\"\u003e\u0026quot;Harry, my dream is a code waiting to be\u003cbr /\u003e\r\n\t\t\t\tbroken. Break the code, solve the crime.\u0026quot; \u003c/basefont\u003e\u003c/td\u003e\r\n\t\t\u003c/tr\u003e\r\n\t\u003c/tbody\u003e\r\n\u003c/table\u003e\r\n\u003cp\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003eAgent Cooper\u003c/basefont\u003e\u003c/p\u003e\r\n\u003cp class\u003d\"paragraph\"\u003e\r\n\t\u003cbasefont face\u003d\"ARIAL\"\u003eSeveral algorithms in modern cryptography are based on the fact that factoring large numbers is difficult. Alicia and Bobby know this, so they have decided to design their own encryption scheme based on factoring. Their algorithm depends on a secret code, K, that Alicia sends to Bobby before sending him an encrypted message. After listening carefully to Alicia\u0026#39;s description, Yvette says, \u0026quot;But if I can intercept K and factor it into two positive integers, A and B, I would break your encryption scheme! And the K values you use are at most 10,000,000. Hey, this is so easy; I can even factor it twice, into two different pairs of integers!\u0026quot;\u003c/basefont\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tThe first line of input gives the number of cases, N (at most 25000). N test cases follow. Each one contains the code, K, on a line by itself.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tFor each test case, output one line containing \u0026quot;Case #x: K \u003d A * B \u003d C * D\u0026quot;, where A, B, C and D are different positive integers larger than 1. A solution will always exist.\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n3\r\n120\r\n210\r\n10000000\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\nCase #1: 120 \u003d 12 * 10 \u003d 6 * 20\r\nCase #2: 210 \u003d 7 * 30 \u003d 70 * 3\r\nCase #3: 10000000 \u003d 10 * 1000000 \u003d 100 * 100000\u003c/pre\u003e"}}]}