Given a positive integer n, find two non-negative integers a, b such that a2+ b2 = n. The first line contains the number of test cases T (1 < = T < = 1000). For each test case, there is only one line with an integer n (1 < = n < = 109) as defined above. For each test case, output two integers a, b separated by a single space such that a2+ b2 = n. If there are multiple solutions, anyone will be accepted. If there is no solution, output " -1" (without quotation marks) instead.

Untitled2.c
Untitled2.exe
Untitled2.o

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．