Subset Sum Easy

Please help me with this problem, I cannot find the issue in this code, I am pasting the same below:

import java.util.*;
public class Main {
public static void main(String args[]) {

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

	while(t>0){

		int n = sc.nextInt();
	int[] arr = new int[n];
	int sum = 0;
	for(int i=0;i<n;i++) {
		arr[i] = sc.nextInt();
		sum+=arr[i];
	}
	
		int count = 0;
		
		count = ss(arr,sum,0);
		
		if(count>arr.length) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
		t--;

	}
	
}

public static int ss(int[] arr,int sum,int count) {
	
	
	if(arr.length==0) {
		if(sum==0)
		return 1;
		
		else
			return 0;
		
	}
	

	int a = arr[0];
	
	int[] temp = Arrays.copyOfRange(arr, 1, arr.length);

	count+=ss(temp,sum,count);
	count+=ss(temp,sum-a,count);
	
	
	return count;

}

}

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.