-- AtCoder My Practice
-- author: Leonardone @ NEETSDKASU

-- 解説読後
-- http://arc060.contest.atcoder.jp/data/arc/060/editorial.pdf

-- 満点解法1
-- 解説にtypo dp[N][k][kA] が正しい

import qualified Data.Array as A
import qualified Data.Map as M

main = print . solve . map read . words =<< getContents

solve (n:a:xs) = ans where
    x  = maximum (a:xs)
    ys = A.listArray (1, n) xs
    dp j k s m =
        case M.lookup (j, k, s) m of
        Just c  -> (c, m)
        Nothing ->
            case True of
                _ | j == 0 && k == 0 && s == 0 -> (1, m)
                _ | j >= 1 && sx < 0 -> ans where
                    (a1, m1) = dp j1 k s m
                    ans = (a1, M.insert (j, k, s) a1 m1)
                _ | j >= 1 && k >= 1 && sx >= 0 -> ans where
                    (a1, m1) = dp j1 k s m
                    (a2, m2) = dp j1 (k - 1) sx m1
                    ans = (a1 + a2, M.insert (j, k, s) (a1 + a2) m2)
                _ -> (0, m)
            where
                j1 = j - 1
                sx = s - (ys A.! j)
    ans = fst $ foldl (\(c, m) k -> let (a1, m1) = dp n k (k * a) m in (c + a1, m1)) (0, M.empty) [1 .. n]