题目1114：神奇的口袋

import java.io.IOException;
import java.io.FileReader;
import java.util.Scanner;

class Main
{
	public static final boolean DEBUG = false;
	public static final int N = 40;
	
	public static void main(String[] args) throws IOException
	{
		Scanner cin;
		int n;
		
		if (DEBUG) {
			cin = new Scanner(new FileReader("d:\\OJ\\uva_in.txt"));
		} else {
			cin = new Scanner(System.in);
		}
		
		while (cin.hasNext()) {
			n = cin.nextInt();
			int[] a = new int[n + 1];
			for (int i = 1; i <= n; i++) {
				a[i] = cin.nextInt();
			}
			
			int[][] f = new int[n + 1][N + 1];
			f[0][0] = 1;
			for (int i = 1; i <= n; i++) {
				for (int j = 0; j <= N; j++) {
					f[i][j] += f[i - 1][j];
					if (j >= a[i]) {
						f[i][j] += f[i - 1][j - a[i]];
					}
				}
			}
			
			System.out.println(f[n][N]);
		}
	}
}