Codeforces Round #294 (Div. 2)B

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

The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — the errors the compiler displayed for the first time.

The third line contains n - 1 space-separated integers b₁, b₂, ..., 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 с₁, с₂, ..., с_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

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-2个数

然后问你不见了哪两个数

题解：用sum1,sum2,sum3分别表示这几个数列的和，然后直接加起来就好，然后减去就可以得到答案了

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 100001
#define eps 1e-9
const int inf=0x7fffffff;   //无限大
ll sum1;
ll sum2;
ll sum3;
int main()
{
        sum1=0;
        sum2=0;
        sum3=0;
        int n;
        cin>>n;
        int a;
        for(int i=0;i<n;i++)
        {
                cin>>a;
                sum1+=a;
        }
        for(int i=0;i<n-1;i++)
        {
                cin>>a;
                sum2+=a;
        }
        for(int i=0;i<n-2;i++)
        {
                cin>>a;
                sum3+=a;
        }
        cout<<sum1-sum2<<endl;
        cout<<sum2-sum3<<endl;
        return 0;
}