import Data.Char
import Data.List

pow q x n
 | n == 0 = 1
 | odd n = mod (x * pow q x (n-1)) q
 | otherwise = mod ((pow q x (div n 2))^2) q

main = do
 n <- getLine
 print (npalin (10^9) n)
 print (npalin (10^9+7) n)

npalin q n = mod (np1 + np2) q
 where
  l = length n
  nh = digitToInt (head n)
  nt = digitToInt (last n)
  (n1,n2) = splitAt (div l 2) n
  np1 = foldr (\p acc -> mod (acc+p) q) 0 (take (l-1) (palins q))
  np2 = (nh-1) * pow q 10 ((div (l+1) 2) - 1) + 
        (if nh<=nt then 1 else 0) * max 1 (sum (zipWith min (map digitToInt (tail (n1 ++ "9"))) (map digitToInt (tail (reverse n2)))))

palins q = unfoldr (\n -> Just (9 * pow q 10 ((div (n+1) 2) - 1), succ n)) 1