import           Data.List

inputN :: IO Int
inputN = readLn

divisor :: Int -> [Int]
divisor n = filter (\x -> mod n x == 0) [1..n]

multNum :: [Int] -> Int
multNum ns = length ns

func :: Int -> Int
func n = multNum . divisor $ n

go :: Int -> Int
go n = foldl' (+) 0 $ map func $ [1..(n-1)]

main :: IO ()
main = do
  n <- inputN
  putStrLn . show . go $ n
  return ()
