codeforces 519B. A and B and Compilation Errors

B. A and B and Compilation Errors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A 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 ≤ 105) — the initial number of compilation errors.

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the errors the compiler displayed for the first time.

The third line contains n - 1 space-separated integers b1, b2, ..., bn - 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.

Sample test(s)

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.

第一行输入n个数，第二行输入n-1个数，检查哪个数消失了，举个例子，把第一行的数和第二行的数分别排一下序，然后从前往后（n-1个数里面）找一对ai!=bi的数，输出ai，

#include<iostream>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<cctype>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#define LL long long
#define PF(x) ((x)*(x))
#define LF(x) ((x)*PF(x))

using namespace std;
const int INF=1<<31-1;
const int max9=1e9;
const int max6=1e6;
const int max3=1e3;

int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}
int t[max6];
int s[max6];
int x[max6];
void solve1(int w)
{
    for(int i=0;i<w;i++)
    {
        if(t[i]!=s[i])
        {
            cout << t[i] << endl;
            return;
        }
    }
    cout << t[w] << endl;
    return;
}
void solve2(int w)
{
    for(int i=0;i<w;i++)
    {
        if(x[i]!=s[i])
        {
            cout << s[i] << endl;
            return;
        }
    }
    cout << s[w] << endl;
    return;
}
int main()
{
    int n;
    while(cin >> n)
    {
        for(int i=0;i<n;i++)   cin >> t[i];
        sort(t,t+n);
        for(int i=0;i<n-1;i++) cin >> s[i];
        sort(s,s+n-1);
        for(int i=0;i<n-2;i++) cin >> x[i];
        sort(x,x+n-2);
        solve1(n-1);
        solve2(n-2);
    }
    return 0;
}