Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. A and B and Compilation Errors

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA and B are preparing themselves for programming contests.

B loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.

Initially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.

However, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.

Can you help B find out exactly what two errors he corrected?

Input

The first line of the input contains integer *n* (3 ≤ *n* ≤ 10^{5}) — the initial number of compilation errors.

The second line contains *n* space-separated integers *a* _{1}, *a* _{2}, ..., *a* _{ n} (1 ≤ *a* _{ i} ≤ 10^{9}) — the errors the compiler displayed for the first time.

The third line contains *n* - 1 space-separated integers *b* _{1}, *b* _{2}, ..., *b* _{ n - 1} — the errors displayed at the second compilation. It is guaranteed that the sequence in the third line contains all numbers of the second string except for exactly one.

The fourth line contains *n* - 2 space-separated integers *с* _{1}, *с* _{2}, ..., *с* _{ n - 2} — the errors displayed at the third compilation. It is guaranteed that the sequence in the fourth line contains all numbers of the third line except for exactly one.

Output

Print two numbers on a single line: the numbers of the compilation errors that disappeared after B made the first and the second correction, respectively.

Examples

Input

5

1 5 8 123 7

123 7 5 1

5 1 7

Output

8

123

Input

6

1 4 3 3 5 7

3 7 5 4 3

4 3 7 5

Output

1

3

Note

In the first test sample B first corrects the error number 8, then the error number 123.

In the second test sample B first corrects the error number 1, then the error number 3. Note that if there are multiple errors with the same number, B can correct only one of them in one step.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/13/2020 00:40:50 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|