#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<int>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int MOD = 1000000007;
//const int MOD = 998244353;


int main() {
	int n;
	cin >> n;
	vi a(n), b(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < n; i++) cin >> b[i];
	vi order(n);
	for (int i = 0; i < n; i++) order[i] = i;

	int cnt = 0;
	int win = 0;

	do {
		vi order2(n);
		for (int i = 0; i < n; i++) order2[i] = i;
		do {
			cnt++;
			int win2 = 0;
			for (int i = 0; i < n; i++) {
				if (a[order[i]] > b[order2[i]]) win2++;
			}
			if (win2 > n - win2) win++;
		} while (next_permutation(order2.begin(), order2.end()));
	} while (next_permutation(order.begin(), order.end()));
	double ans = (double)win / cnt;
	cout << ans << endl;

	return 0;
}