{"raw_statement":[{"iden":"problem statement","content":"#nck { width: 30px; height: auto; }There are $N$ computers and $N$ sockets in a one-dimensional world. The coordinate of the $i$\\-th computer is $a_i$, and the coordinate of the $i$\\-th socket is $b_i$. It is guaranteed that these $2N$ coordinates are pairwise distinct.\nSnuke wants to connect each computer to a socket using a cable. Each socket can be connected to only one computer.\nIn how many ways can he minimize the total length of the cables? Compute the answer modulo $10^9+7$."},{"iden":"constraints","content":"*   $1 ≤ N ≤ 10^5$\n*   $0 ≤ a_i, b_i ≤ 10^9$\n*   The coordinates are integers.\n*   The coordinates are pairwise distinct."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$a_1$\n:\n$a_N$\n$b_1$\n:\n$b_N$"},{"iden":"sample input 1","content":"2\n0\n10\n20\n30"},{"iden":"sample output 1","content":"2\n\nThere are two optimal connections: $0-20, 10-30$ and $0-30, 10-20$. In both connections the total length of the cables is $40$."},{"iden":"sample input 2","content":"3\n3\n10\n8\n7\n12\n5"},{"iden":"sample output 2","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}