Rolling

You are given an array with $N$ elements. You have to make a set which contains size of all the subsets of the array whose sum is $S$. Let's denote this set by $H(S)$. Now, Let maxmz denote the number of unique elements in the set $H(S)$. Your task is to find the minimum and maximum value of maxmz and print the value $S$ for the given array. $S$ may have more than one value. Print the smalle