killjee has an array A containing N integers. You need to find number of distinct values which are there in a special list prepared by Killjee using array A.

Special list of killjee contains sum of subarrays of array A.

Sum of subarray is sum of all elements in subarray

INPUT CONSTRAINTS

• $1 \le N \le 1000$
• $1 \le a_i \le 10^9$

INPUT FORMAT

First line of input contains a single integer N, Next line contains N space separated integer $A_i$.

OUTPUT FORMAT

Print answer to the problem.