Write a program that inputs 7 digits ($0 \le \text{each digit} \le 9$) and counts the number of ways one can extract a set of digits to sum to 25. The digit `0' means 10, not 0.

This input:

5 0 1 5 4 3 7

yields five different sums to 25:

        5 0       3 7
        5   1 5 4 3 7
        5 0 1 5 4
          0 1   4 3 7
          0   5   3 7

Input

A single line with seven single digit integers.

Output

A single line that tells the number of subsets that sum to 25.

Examples

Input 1

5 0 1 5 4 3 7

Output 1

5

Problem credits: Don Piele, 1982