Migrated from Lutece 1170 红与蓝

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

平面上有N个红点和N个蓝点，求红点到蓝点的最近距离

Input

第一行为一个整数N $1\le N \le 100000$ 接下来第N行每行两个整数xi,yi，表示第i个红点的坐标
接下来第N行每行两个整数xi,yi，表示第i个蓝点的坐标($1\le x,y \le 100000$)

Output

红点到蓝点的最短距离

Samples

4
0 0
0 1
1 0
1 1
2 2
2 3
3 2
3 3

1.414

Resources

xwind