Highly Composite Permutation

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Stack;

public class Kilpalaatikko {
    
    public static boolean[] alkuluku;
    
    public static void main(String[] args) {
        IO io = new IO();
        
        int n = io.nextInt();
        alkuluku = new boolean[n * n];
        for (int i = 1; i < n * n; i++) {
            alkuluku[i] = true;
            for (int j = 2; j < i; j++) {
                if (i % j == 0) {
                    alkuluku[i] = false;
                    break;
                }
                
            }
        }
        Stack<Integer> pino = new Stack();
        Stack<Integer> pino2 = new Stack();
        boolean[] used = new boolean[n + 1];
        if(n == 1){
            io.print("-1");
            io.close(); 
            return;
        }
        for (int i = n; i > 0; i--) {
            if (alkuluku[i]) {
                continue;
            }
            pino.add(i);
            
            used[i] = true;
            if (re(pino, used, n, i, 1)) {
                break;
            }
            used[i] = false;
            pino.pop();
        }
        if (pino.isEmpty()) {
            io.print("-1");
        }
        while (!pino.isEmpty()) {
            pino2.add(pino.pop());
        }
        while (!pino2.isEmpty()) {
            io.print(pino2.pop() + " ");
        }
        
        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta

    }
    
    public static boolean re(Stack<Integer> pino, boolean[] used, int n, int sum, int monta) {
        if (monta == n) {
            return true;
        }
        
        for (int i = n; i > 0; i--) {
            if (used[i] || alkuluku[sum + i]) {
                continue;
            }
            
            pino.add(i);
            used[i] = true;
            if (re(pino, used, n, sum + i, monta + 1)) {
                return true;
            }
            used[i] = false;
            pino.pop();
        }
        
        return false;
        
    }
    
}

class pari implements Comparable<pari> {
    
    int x;
    int y;
    int z;
    
    public pari(int x, int y, int z) {
        this.x = x;
        this.y = y;
        this.z = z;
    }
    
    public int getX() {
        return x;
    }
    
    public void setX(int x) {
        this.x = x;
    }
    
    public int getY() {
        return y;
    }
    
    public void setY(int y) {
        this.y = y;
    }
    
    @Override
    public int compareTo(pari o) {
        return -o.y + this.y;
    }
    
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: ACCEPTED

Test 77

Verdict: ACCEPTED

Test 78

Verdict: ACCEPTED

Test 79

Verdict: ACCEPTED

Test 80

Verdict: ACCEPTED

Test 81

Verdict: ACCEPTED

Test 82

Verdict: ACCEPTED

Test 83

Verdict: ACCEPTED

Test 84

Verdict: ACCEPTED

Test 85

Verdict: ACCEPTED

Test 86

Verdict: ACCEPTED

Test 87

Verdict: ACCEPTED

Test 88

Verdict: ACCEPTED

Test 89

Verdict: ACCEPTED

Test 90

Verdict: ACCEPTED

Test 91

Verdict: ACCEPTED

Test 92

Verdict: ACCEPTED

Test 93

Verdict: ACCEPTED

Test 94

Verdict: ACCEPTED

Test 95

Verdict: ACCEPTED

Test 96

Verdict: ACCEPTED

Test 97

Verdict: ACCEPTED

Test 98

Verdict: ACCEPTED

Test 99

Verdict: ACCEPTED

Test 100

Verdict: ACCEPTED