import qualified Data.Set as Set

main :: IO ()
main = do
    n <- read <$> getLine
    print $ solve n

solve :: Int -> Int
solve n = length $ Set.fromList $ divisor n (floor $ sqrt $ fromIntegral n)

divisor :: Int -> Int -> [String]
divisor n 0 = []
divisor n i = if n `mod` i == 0
    then if i ^ 2 /= n
        then ((show (n `div` i)) ++ (show i)) : ((show i) ++ (show $ n `div` i)) : divisor n (i - 1)
        else ((show i) ++ (show $ n `div` i)) : divisor n (i - 1)
    else divisor n (i - 1)