import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    col={'5': 20199, '7': 20163, '0': 20104, '1': 20063, '3': 20011, '8': 19956, '6': 19898, '2': 19892, '4': 19874, '9': 19841}
    s=input()
    cnt=Counter(s)
    for k,v in col.items():
        if cnt[k]<v:less=k
        if cnt[k]>v:over=k
    print(over,less)



main()