For this Question: Find number of ways an integer N can be represented as a sum of unique natural numbers.First line contain an integer T denoting number of test cases. Each test case contains a single integer N.

Constraint:-
1 <= T <= 100
0 <= N <= 120Print a single integer containing number of ways.Sample input
4
6
1
4
2

Sample output:-
4
1
2
1

Explanation:-
TestCase1:-
6 can be represented as (1, 2, 3), (1, 5), (2, 4), (6), I have written this Solution Code: import java.io.*;
import java.util.*;

class Main {
    public static void main (String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        for(int i=0;i<t;i++){
            int n = Integer.parseInt(br.readLine());
            System.out.println(Ways(n,1));
        }
    }
   static int Ways(int x, int num)
    {
        int val =(x - num);
        if (val == 0)
            return 1;
        if (val < 0)
            return 0;
        return Ways(val, num + 1) + Ways(x, num + 1);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?