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

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

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)
    nx = n * x
    ys = A.listArray (1, n) $ map (+ (-a)) xs
    dp j t m =
        case M.lookup (j, t) m of
        Just c  -> (c, m)
        Nothing ->
            case True of
                _ | j == 0 && t == nx -> (1, m)
                _ | j >= 1 && (ty <  0 || ty >  2 * nx) -> ans where
                    (a1, m1) = dp j1 t m
                    ans = (a1, M.insert (j, t) a m1)
                _ | j >= 1 && (ty >= 0 && ty <= 2 * nx) -> ans where
                    (a1, m1) = dp j1 t m
                    (a2, m2) = dp j1 ty m1
                    ans = (a1 + a2, M.insert (j, t) (a1 + a2) m2)
                _ -> (0, m)
        where
            j1 = j - 1
            ty = t - (ys A.! j)
    ans = fst (dp n nx M.empty) - 1