$Neha$  is given a number $N$. She always looks for special thing , this time she is looking for $Special$ $Number$ and $Partial$ $Special$ $Number$. A $Special$ $Number$ is a number whose product of its digits is equal to number itself i.e. $N $, and in this number there is no digit $1$. $Partial$ $Special$ is a number having all the condition same as $Special$ except that it can also have digit $1$ in it .Neha have to count the number of $Special$ and $Partial$ $Special$ $Numbers $for a given  $N$ . She is not so good in programming , so go and help her.

-----Input:-----
- Integers $N$ is taken as input from input stream. 

-----Output:-----
- Print the number of  $Special$ and $Partial$ $Special$ $Numbers $for a given  $N$.

-----Constraints-----
- $1 \leq N \leq 100$ numbers to be count will be less then 10^6

-----Sample Input:-----
3

-----Sample Output:-----
1 20

-----EXPLANATION:-----
There are only one natural numbers, the product of the digits of which is 3  :- {3}.
There are 20 natural numbers with digit 1 , whose  product of the digits  is 3 :-{13, 31, 113 ,131 311 ,1113 ,1131 ,1311, 3111 ,11113, 11131, 11311 ,13111, 31111, 111113, 111131, 111311,113111, 131111 ,311111}

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# cook your dish here\n\ne=[[6 ,0],\n[20, 1],\n[20, 1],\n[54, 2],\n[20, 1],\n[88, 3],\n[20, 1],\n[122, 4],\n[54, 2],\n[68 ,2],\n[0 ,0],\n[238, 7],\n[0 ,0],\n[68, 2],\n[68, 2],\n[224, 7],\n[0, 0],\n[238, 7],\n[0 ,0],\n[170 ,5],\n[68 ,2],\n[0 ,0],\n[0, 0],\n[522 ,17],\n[34 ,1],\n[0, 0],\n[102 ,3],\n[170 ,5],\n[0 ,0],\n[272 ,8],\n[0 ,0],\n[358 ,13],\n[0 ,0],\n[0 ,0],\n[68 ,2],\n[630 ,21],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[352, 12],\n[0 ,0],\n[272 ,8],\n[0 ,0],\n[0 ,0],\n[170 ,5],\n[0 ,0],\n[0 ,0],\n[928 ,38],\n[34 ,1],\n[102 ,3],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[454 ,15],\n[0 ,0],\n[352 ,12],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[648 ,24],\n[0 ,0],\n[0 ,0],\n[170 ,5],\n[502 ,24],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[0 ,0],\n[204 ,6],\n[0 ,0],\n[1300 ,58],\n[0, 0],\n[0, 0],\n[102, 3],\n[0, 0],\n[0, 0],\n[0, 0],\n[0, 0],\n[576 ,26],\n[156, 5],\n[0, 0],\n[0, 0],\n[648, 24],\n[0 ,0],\n[0, 0],\n[0 ,0],\n[0, 0],\n[0 ,0],\n[648, 24],\n[0, 0],\n[0, 0],\n[0, 0],\n[0 ,0],\n[0 ,0],\n[1380, 82],\n[0 ,0],\n[102, 3],\n[0 ,0],\n[222, 9]\n]\n\nn=int(input())\n\nprint(e[n-1][1],e[n-1][0])'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 21769