#define _USE_MATH_DEFINES #include using namespace std; using ll = long long; using ull = unsigned long long; using pil = pair; using pli = pair; template using piT = pair; template using pTi = pair; template using pTT = pair; using pii = pair; using vi = vector; using vvi = vector; using vvvi = vector; using pll = pair; using vl = vector; using vvl = vector; using vvvl = vector; using pbb = pair; using vb = vector; using vvb = vector; using vvvb = vector; using pcc = pair; using vc = vector; using vvc = vector; using vvvc = vector; using pss = pair; using vs = vector; using vvs = vector; using vvvs = vector; using pdd = pair; using vd = vector; using vvd = vector; using vvvd = vector; #define rep0(times) for(int counter = 0; counter < (int)(times); ++counter) #define rep(counter, goal) for (int counter = 0; counter < (int)(goal); ++counter) #define rep2(counter, start, goal) for (int counter = (int)(start); counter < (int)(goal); ++counter) #define rep3(counter, start, goal) for (int counter = (int)(start); counter > (int)(goal); --counter) #define all(container) begin(container), end(container) template bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } template bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } void Yn(bool flag) { cout << (flag ? "Yes" : "No") << "\n"; } void yn(bool flag) { cout << (flag ? "yes" : "no") << "\n"; } void YN(bool flag) { cout << (flag ? "YES" : "NO") << "\n"; } void set_prec(const int &digits) { cout << fixed << setprecision(digits); cerr << fixed << setprecision(digits); } // #include // using namespace atcoder; // void pr(const atcoder::modint1000000007 &obj) { cerr << obj.val(); }; // void pr(const atcoder::modint998244353 &obj) { cerr << obj.val(); }; // void pr(const atcoder::modint &obj) { cerr << obj.val(); }; template void pr(const T &obj) { cerr << obj; } template void pr(const T &first, const Ts &...rest) { pr(first); pr(", "); pr(rest...); } template void pr(const pair &pair) { pr("("); pr(pair.first); pr(", "); pr(pair.second); pr(")"); } template void pr(const vector &vec) { pr("{"); for (T obj : vec) { pr(obj); pr(", "); } pr("}"); } template void pr(const vector> &vv) { pr("\n"); rep(index, vv.size()) { pr("["); pr(index); pr("]: "); pr(vv[index]); pr("\n"); } } template void pr(const set &vec) { pr("{"); for (T obj : vec) { pr(obj); pr(", "); } pr("}"); } template void pr(const map &map) { pr("{"); for (pair pair : map) { pr("("); pr(pair.first); pr(": "); pr(pair.second); pr("), "); } pr("}"); } #define db(obj) cerr << #obj << ": "; pr(obj); cerr << " " #define dl(obj) db(obj); cerr << "\n"; #define dm(...) cerr << "(" << #__VA_ARGS__ << "): ("; pr(__VA_ARGS__); cerr << ") " #define dml(...) dm(__VA_ARGS__); cerr << "\n" // const ll MOD = 1000000007; // using mint = modint1000000007; // const ll MOD = 998244353; // using mint = modint998244353; // using mint = modint; vi A_cards, B_cards; int A_wins = 0; void permutation(int n) { assert(n >= 0); vi p; rep(i, n) p.push_back(i); do { int A_point = 0, B_point = 0; rep(j, n) { if (A_cards[j] > B_cards[p[j]]) ++A_point; else if (A_cards[j] < B_cards[p[j]]) ++B_point; } if (A_point > B_point) ++ A_wins; } while (next_permutation(all(p))); } int main() { int N; cin >> N; A_cards = B_cards = vi(N); rep(i, N) cin >> A_cards[i]; rep(i, N) cin >> B_cards[i]; permutation(N); double ans = A_wins; rep2(i, 1, N + 1) ans /= i; cout << ans << endl; }