{"raw_statement":[{"iden":"statement","content":"A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly _n_ pixels.\n\nYour task is to determine the size of the rectangular display — the number of lines (rows) of pixels _a_ and the number of columns of pixels _b_, so that:\n\n*   there are exactly _n_ pixels on the display;\n*   the number of rows does not exceed the number of columns, it means _a_ ≤ _b_;\n*   the difference _b_ - _a_ is as small as possible."},{"iden":"input","content":"The first line contains the positive integer _n_ (1 ≤ _n_ ≤ 106) — the number of pixels display should have."},{"iden":"output","content":"Print two integers — the number of rows and columns on the display."},{"iden":"examples","content":"Input\n\n8\n\nOutput\n\n2 4\n\nInput\n\n64\n\nOutput\n\n8 8\n\nInput\n\n5\n\nOutput\n\n1 5\n\nInput\n\n999999\n\nOutput\n\n999 1001"},{"iden":"note","content":"In the first example the minimum possible difference equals 2, so on the display should be 2 rows of 4 pixels.\n\nIn the second example the minimum possible difference equals 0, so on the display should be 8 rows of 8 pixels.\n\nIn the third example the minimum possible difference equals 4, so on the display should be 1 row of 5 pixels."}],"translated_statement":[{"iden":"statement","content":"一家大公司决定推出一系列矩形显示屏，并决定显示屏必须恰好有 #cf_span[n] 个像素。\n\n你的任务是确定矩形显示屏的尺寸——即像素的行数 #cf_span[a] 和列数 #cf_span[b]，使得：\n\n第一行包含正整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 106]）——显示屏应具有的像素数量。\n\n请输出两个整数——显示屏的行数和列数。\n\n在第一个例子中，最小可能的差值为 2，因此显示屏应为 2 行，每行 4 个像素。\n\n在第二个例子中，最小可能的差值为 0，因此显示屏应为 8 行，每行 8 个像素。\n\n在第三个例子中，最小可能的差值为 4，因此显示屏应为 1 行，每行 5 个像素。\n\n"},{"iden":"input","content":"第一行包含正整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 106]）——显示屏应具有的像素数量。"},{"iden":"output","content":"请输出两个整数——显示屏的行数和列数。 "},{"iden":"examples","content":"输入8输出2 4输入64输出8 8输入5输出1 5输入999999输出999 1001"},{"iden":"note","content":"在第一个例子中，最小可能的差值为 2，因此显示屏应为 2 行，每行 4 个像素。在第二个例子中，最小可能的差值为 0，因此显示屏应为 8 行，每行 8 个像素。在第三个例子中，最小可能的差值为 4，因此显示屏应为 1 行，每行 5 个像素。"}],"sample_group":[],"show_order":[],"formal_statement":"Given a positive integer $ n $ where $ 1 \\leq n \\leq 10^6 $, find integers $ a $ and $ b $ such that:\n\n- $ a \\cdot b = n $,\n- $ a \\leq b $,\n- $ b - a $ is minimized.\n\nOutput: $ a $ and $ b $.","simple_statement":null,"has_page_source":false}