1456 P Number Extended Reloaded
Submit solution
Points:
100
Time limit:
1.0s
Memory limit:
32M
Problem types
Allowed languages
C, C++, Java, Python
Description
Given a sequence b1, b2, b3… bn of even length, the occurrence of every bi (i=1, 2, 3…n) is an even number except two numbers, the P numbers, which occur odd times. Your task is to find those two P numbers.
Input
The input file contains several test case, each test case starts with a line contains an even number n (0<n<10 000), the length of the sequence, followed by a line with n numbers b1, b2, b3…bn. It is guaranteed that every bi (i=1, 2, 3..,n) can be represented by a signed integer. The input is terminated by a test case with n = 0. It should not be processed.
Output
For each test case, output a line the P numbers of the corresponding sequence in ascending order with a space character between the two numbers.
Sample
Input
6
2 3 2 3 4 5
8
2 2 2 2 2 2 2 9
0
Output
4 5
2 9
Comments