The input consists of:

one line with an integer n ( 2≤n≤200000), the number of camels;

one line with n integers a1,…,ana1,…,an ( 1≤ai≤n for all i ), Jaap's bet. Here a1 is the camel in the first position of Jaap's bet, a2 is the camel in the second position, and so on;

one line with Jan's bet, in the same format as Jaap's bet;

one line with Thijs' bet, in the same format as Jaap's bet.

The camels are numbered 1,…,n . Each camel appears exactly once in each bet.

输入包括：

第一行是一个整数n（2<=n<=200000），骆驼的数量。

第二行有n个整数a1…an（1<=ai<=n），是Jaap的下赌名单。a1是名单中第一位，a2是第二位，等等。

第三行是Jan的名单，格式同上。

第四行是Thijs的名单，格式同上。

骆驼从1到n编号，每头骆驼在一份名单中只出现一次。