Kay's Favourite Numbers

By Kay Akashi

Problem Statement

You're given an integer array $a$ consisting of $n$ distinct integers $a_{1}$, …, $a_{n}$, Kay's favourite numbers. Then you're given an integer array $b$ consisting of integers $b_{1}$, …, $b_{n}$. Count the number of $i$ $(1 \leq i \leq n)$ such that $b_{i}$ is one of Kay's favourite numbers.

Note that, $b$ doesn't necessarily consist of distinct integers.

Constraints

$1 \leq n \leq 10^{5}$.

Subtask 1 (20%)

$1 \leq n \lt 100$. No element in $a$ and $b$ is larger than $200$ and smaller than $1$.

Subtask 2 (80%)

$100 \leq n \leq 10^{5}$. No element in $a$ and $b$ is larger than $10^{7}$ and smaller than $1$.

Input

The first line contains one number, $n$. The second line contains $n$ numbers, which is an array $a$. The third line also contains $n$ numbers, which is an array $b$.

Output

Output the answer.

Examples

3
1 7 9
4 9 9

2

3
1 2 3
3 2 1

3