import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); Integer[] a = new Integer[N]; Integer[] b = new Integer[N]; for (int i = 0; i < N; i++) { a[i] = sc.nextInt(); } for (int i = 0; i < N; i++) { b[i] = sc.nextInt(); } Integer[] bcache = new Integer[N]; for (int i = 0; i < N; i++) { bcache[i] = b[i]; } int cnt = 0; int win = 0; Arrays.sort(a); Arrays.sort(b); do { do { int awin = 0; int bwin = 0; for (int i = 0; i < N; i++) { if (a[i] > b[i]) awin++; if (b[i] > a[i]) bwin++; } if (awin > bwin) win++; cnt++; } while ((b = (Integer[]) nextPermutation(b)) != null); b = new Integer[N]; for (int i = 0; i < N; i++) { b[i] = bcache[i]; } } while ((a = (Integer[]) nextPermutation(a)) != null); System.out.println(1.0 * win / cnt); } private static Comparable[] nextPermutation(final Comparable[] c) { int first = _getFirst(c); if (first == -1) return null; int toSwap = c.length - 1; while (c[first].compareTo(c[toSwap]) >= 0) { toSwap--; } swap(c, first++, toSwap); toSwap = c.length - 1; while (first < toSwap) { swap(c, first++, toSwap--); } return c; } private static void swap(final Comparable[] c, final int i, final int j) { final Comparable tmp = c[i]; c[i] = c[j]; c[j] = tmp; } private static int _getFirst(final Comparable[] c) { for (int i = c.length - 2; i >= 0; i--) { if (c[i].compareTo(c[i + 1]) < 0) { return i; } } return -1; } }