There are two arrays of positive integers a[1..n] and b[1..n]. Find a permutation i1,i2,...,in of numbers 1,2,...,n, for which the sum
is minimal. Each number should appear only once in the permutation.
The first line contains the number of elements n (n≤100) in the arrays. The second line contains the elements of the first array, and the third line contains the elements of the second array. The array elements do not exceed 106.
Print the minimal value of required sum.