For this Question: There is a rope of length L which you have to cut at 11 positions to divide it into 12 ropes. Here, each of the 12 resulting ropes must have a positive integer length.
Find the number of ways to do this division.
Note: Two ways to do the division are considered different if and only if there is a position cut in only one of those ways.Input contains a single integer L.

Constraints:
12 <= L <= 200Print the number of ways to do the division.Sample Input 1
12

Sample Output 1
1

Sample Input 2
13

Sample Output 2
12, I have written this Solution Code: import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
	public static void main (String[] args) {
                      // Your code here

        Scanner sc = new Scanner(System.in);
        int rope = sc.nextInt();
        

        System.out.println(possibleValues(rope));

	}
    static long possibleValues(int rope)
    {
        long ans = 1;

        for(int i = 1; i < 12; i++)
        {
            ans *= (rope-i);
            ans /= i;
        }

        return ans;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?