Mafia#234
Today Don Capone celebrates the anniversary of his mafia clan. On this occasion, he has invited representatives from all clans. (1 \leq N \leq 1000) guests have come to the celebration. Each clan brings a holiday gift — a case with some sum of money, which is an integer number of thousands of dollars (0 \leq D_i \leq 100). Don Capone is very fastidious; he evaluates the cases by their appearance. If he likes a case, he accepts the gift; otherwise, he refuses it and asks the guest to leave. Don's assistant knows how much money each guest brought, but does not know which cases Don will reject. Now the assistant wants to determine all possible total amounts of money that Don might end up with.
The first line contains the number of test cases (1 \leq T \leq 10). Each test consists of two lines: the first line contains one integer — the number of guests; the second line contains integers D_1, D_2, \ldots, D_N (separated by spaces) — the amounts of money, in thousands of dollars, offered as gifts.
For each test case, print a single line containing one integer — the number of distinct total amounts that Don might receive.
Example 1