@@ -0,0 +1,640 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0A/**%0A*   Solution to https://www.hackerrank.com/challenges/extra-long-factorials/%0A*/%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A%0A        int n = readInt(in);%0A%0A        BigDecimal result = new BigDecimal(1);%0A%0A        for (int i = n; i %3E 0; i--) %7B%0A            result = result.multiply(new BigDecimal(i));%0A        %7D%0A%0A        System.out.println(result);%0A    %7D%0A%0A    private static int readInt(Scanner in) %7B%0A        return Integer.parseInt(in.nextLine().trim());%0A    %7D%0A%7D%0A

Create extra-long-factorials.java