#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N;
int AB[4];
vector<vector<int>> p[2];

int main(int argc, char **argv) {
	cin >> N;
	REP(i, 2) {
		REP(j, N) cin >> AB[j];
		sort(AB, AB + N);
		do {
			p[i].emplace_back(N);
			REP(j, N) p[i][p[i].size() - 1][j] = AB[j];
		} while (next_permutation(AB, AB + N));
	}
	int res = 0;
	REP(i, p[0].size()) REP(j, p[1].size()) {
		int cnt = 0;
		REP(k, N) if (p[0][i][k] > p[1][j][k]) ++cnt;
		if (cnt > N - cnt) ++res;
	}
	cout << fixed << setprecision(4) << ((double)res / (p[0].size() * p[1].size())) << endl;
	return 0;
}