#include #include #include #include #include #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; // const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, // dx[] = {0, -1, -1, -1, 0, 1, 1, 1}; struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(10); } } iosetup; /*-------------------------------------------------*/ int main() { int n; cin >> n; vector a(n), b(n); REP(i, n) cin >> a[i]; REP(i, n) cin >> b[i]; sort(ALL(a)); sort(ALL(b)); int win = 0, cnt = 0; do { do { int tmp = 0; REP(i, n) tmp += a[i] > b[i]; if (tmp >= n / 2 + 1) ++win; ++cnt; } while (next_permutation(ALL(b))); sort(ALL(b)); } while (next_permutation(ALL(a))); cout << (double)win / cnt << '\n'; return 0; }