A1125 | [COCI-2007_2008-contest5]#1 AVOGADRO

Luka is slacking again during chemistry class, while the teacher is explaining Avogadro's law.
Luka first drew a table consisting of 3 rows and N columns. Then he wrote the numbers 1 to N into the first row in arbitrary order, each number appearing exactly once. In the other two rows he also wrote integers between 1 and N, but didn't care how many times a number appeared.
Luka can now delete any set of columns from the table. After doing so, he sorts the numbers in each row in ascending order.
He wants to obtain a table in which all three rows are identical after sorting. Write a program that determines the smallest number of columns he must delete.

The first line of input contains the integer N (1 ≤ N ≤ 100000), the number of columns in the table.
The following three lines contain N integers each, separated by single spaces. The numbers will be between 1 and N, and there will be no duplicates in the first row.

Output the smallest number of columns Luka must delete.