Given two arrays a and b of same size.Your task is to find minimum sum of two elements such that they belong to different arrays and are not at same index in their arrays.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the size of the array. Then next two lines contains n space separated integers forming the arrays.