Given an array **A** of size **N**. The contents of A are copied into another array **B** and numbers are shuffled. Also, one element is removed from B. The task is to find the missing element.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then T test cases follow. Each testcase contains **three **lines of input. The first line contains an integer **N**, where N is the size of array. The second line contains **N** space separated integers denoting elements of the array **A[ ]**. The third line contains **N-1** space separated integers denoting elements of the array **B[ ]**.

**Output:**

For each testcase, **print the missing number**.

**Constraints:**

1 <= T <= 1000

1 <= N <= 10^{7}

1 <= A, B <= 10^{10}

**Example:
Input:**

2

5

1 3 5 6 9

1 9 6 5

3

1 2 3

1 3

**Output:**

3

2

**Explanation:
Testcase1: **3 is the only element missing from B.

Author: sujnesh

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

ShubhamJain18 | 205 |

makeitdonesolo | 140 |

lost_found | 124 |

maggiiiii | 118 |

SahatPrasad1 | 108 |

Bishnu Dev Panda | 777 |

okayboss | 551 |

ShubhamJain18 | 516 |

yk12 | 514 |

makeitdonesolo | 480 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.