import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); StringBuilder sb = new StringBuilder(); int n = sc.nextInt(); Point[] arr = new Point[n]; for(int i = 0; i < n; i++){ arr[i] = new Point(sc.nextLong()); } for(int i = 0; i < n; i++){ arr[i].b = sc.nextLong(); } Arrays.sort(arr); long[] a = new long[n]; long[] b = new long[n]; for(int i = 0; i < n; i++){ a[i] = arr[i].a; b[i] = arr[i].b; } double nowA = a[0]; long nowB = b[0]; for(int i = 1; i < n; i++){ nowA = (nowA*nowB + a[i]*b[i])/(double)(nowA+a[i]); nowB += b[i]; //pw.println(nowA + " " + nowB); } int left = beamSearch(a,(long)Math.floor(nowA)); long a1 = a[left]; long ans = 0; for(int i = 0; i < n; i++){ ans += Math.abs(a1-a[i])*b[i]; } if(left < n-1){ long a2 = a[left+1]; long ans2 = 0; for(int i = 0; i < n; i++){ ans2 += Math.abs(a2-a[i])*b[i]; } if(ans > ans2){ ans = ans2; a1 = a2; } } pw.println(a1 + " " + ans); pw.flush(); } public static int beamSearch(long[] arr, long target){ int left = 0; int right = arr.length; while(right-left > 1){ int mid = (left+right)/2; if(arr[mid] > target){ right = mid; }else{ left = mid; } } return left; } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class Point implements Comparable{ long a,b; public Point(long a){ this.a = a; } public int compareTo(Point p){ if(this.a < p.a){ return -1; }else if(this.a > p.a){ return 1; }else{ return 0; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }