Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)
There is a permutation without two numbers in it, and now you know what numbers the permutation has. Please find the two numbers it lose.
There is a number \(T\) shows there are \(T\) test cases below. ($T \leq 10$)
For each test case , the first line contains a integers \(n\) , which means the number of numbers the permutation has. In following a line , there are $n$ distinct postive integers.($1 \leq n \leq 1,000$)
For each case output two numbers , small number first.
BestCoder Round #28