Soluson fa brodas
Soluson fa brodas in java usin MassifIntejah\n\nimport java.math.BigInteger;\nclass Solution {\n    \n    public int numPrimeArrangements(int n) {\n        int 
Soluson fa brodas in java usin MassifIntejah\n```\nimport java.math.BigInteger;\nclass Solution {\n    \n    public int numPrimeArrangements(int n) {\n        int np = numOfPrimes(n);\n        int nnp = n-np;\n        BigInteger ansa = fact(np).multiply(fact(nnp));\n        ansa = ansa.mod(BigInteger.valueOf(1000000007));\n        return ansa.intValue();\n    }\n    \n    private BigInteger fact(int n){\n        BigInteger ret = BigInteger.valueOf(1);\n        while(n > 1){\n            ret = ret.multiply(BigInteger.valueOf(n));\n            n--;\n        }\n        return ret;\n    }\n    \n    private int numOfPrimes(int n){\n        int[] primes = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};\n        int count = 0;\n        for(int each : primes){\n            if(each > n){\n                break;\n            }\n            count++;\n        }\n        return count;\n    }\n    \n}\n```
['Java']