Farmer John raises n breeds of cows, conveniently numbered 1 .. n. Some pairs of breeds are friendlier than others, a property that turns out to be easily characterized in terms of breed ID: breeds a and b are friendly if |a − b| ≤ 4, and unfriendly otherwise.

A long road runs through FJ's farm. There is a sequence of n fields on one side of the road (one designated for each breed), and a sequence of n fields on the other side of the road (also one for each breed). To help his cows cross the road safely, FJ wants to draw crosswalks over the road. Each crosswalk should connect a field on one side of the road to a field on the other side where the two fields have friendly breed IDs (it is fine for the cows to wander into fields for other breeds, as long as they are friendly). Each field can be accessible via at most one crosswalk (so crosswalks don't meet at their endpoints).

Given the ordering of n fields on both sides of the road through FJ's farm, please help FJ determine the maximum number of crosswalks he can draw over his road, such that no two intersect.

Input

The first line contains n (1 ≤ n ≤ 1000). The next n lines describe the order, by breed ID, of fields on one side of the road; each breed ID is an integer in the range 1 .. n. The last n lines describe the order, by breed ID, of the fields on the other side of the road. Each breed ID appears exactly once in each ordering.

Output

Print the maximum number of disjoint "friendly crosswalks" Farmer John can draw across the road.