跑跑卡丁车

★实验任务

有 n 辆卡丁车车牌号分别为 1，2，…，n 在高速公路上竞速。Coffee 是位跑跑卡丁车爱

好者，她在比赛的过程中拍摄了两张照片，在照片上可以清晰的看到每辆车的的车牌号。

给出两张照片上从第一名到最后一名的车牌号，请你编程计算这两张照片的拍摄时间段内

至少发生了几次超车。

★数据输入

输入第一行包括一个正整数 n（1<=n<=50000），表示卡丁车数量。接下来两行，每行

包括 n 个整数，表示照片上从第一名到最后一名的车牌号（1 到 n 的全排列），每两个数之

间用一个空格隔开。

★数据输出

输出仅有一个数，即至少发生的超车次数，答案在 int 型范围内。-KartRider

★ experimental tasks

Kart n vehicle license plate number are respectively 1,2, ..., n racing on the highway. Coffee is a KartRider love

Well is the course of the game she shot two photos in the photo can clearly see each vehicle s license plate number.

Shows two photographs from the first to the last one on the license plate number, please calculate your programming time period these two photos were taken

Occurred at least several overtaking.

★ data input

Enter the first line contains a positive integer n (1 <= n <= 50000), said the number of karting. The next two lines, each line

Including the n integers, said the photo first to the last one from the license plate number (1 to n the full array), each of the two numbers

Separated by a space between.

★ data output

Output is only one number, that at least the number of overtaking occurred, the answer is in the range of int type.