#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ typedef long double ld; ld solve(){ ld res = 0; ll N; cin >> N; vector A(N),B(N); for(auto& in:A) cin >> in; for(auto& in:B) cin >> in; ld game = 0,win = 0; vector ord_A(N),ord_B(N); iota(ord_A.begin(),ord_A.end(),0); do{ iota(ord_B.begin(),ord_B.end(),0); do{ int win_A = 0; for(int i = 0; i < N;i++){ win_A += (A[ord_A[i]]>B[ord_B[i]])?1:(A[ord_A[i]]0) win++; }while(next_permutation(ord_B.begin(),ord_B.end())); }while(next_permutation(ord_A.begin(),ord_A.end())); res = win/game; return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(12) << solve() << endl; return 0; }